On Optimality Theorems for Semidefinite Linear Vector Optimization Problems
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Recently, semidefinite optimization problems have been intensively studied since many optimization problem can be changed into the problems and the the problems are very computationable. In this paper, we consider a semidefinite linear vector optimization problem (VP) and we establish the optimality theorems for (VP), which holds without any constraint qualification.
Abstract
Recently, semidefinite optimization problems have been intensively studied since many optimization problem can be changed into the problems and the the problems are very computationable. In this paper, we consider a semidefinite linear vector optimization problem (VP) and we establish the optimality theorems for (VP), which holds without any constraint qualification.
참고문헌 (9)
- R. S. Burachik, "Dual condition for the convex subdifferential sum formula with applications", J. Con. Analy, 12, pp.279~290 (2005)
- Etienne de Klerk, "Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications" (2002), Kluwer Academic Publishers
- A.M. Geoffrion, "Proper efficiency and the theory of vector optimization", Journal of Math-ematical Analysis and Applications, 22, pp.618~630 (1968)
- G. Y. Li, "Robust conjugate duality for convex optimization under uncertainty with application to data classification", Nonlinear Anal, 74, pp.2327~2341 (2011)
- J. Jahn, "Introduction to the Theory of Nonlinear Optimization" (2007), Springer-Verlag Berlin
- J. Jeyakumar, "New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs", SIAM J. Optim, 14, pp.534~547 (2003)
- M. H. Kim, "On Semidefinite linear fractional optimization problems", J. Nonlinear and Convex Anal
- 이규명, "On optimality conditions for abstract convex vector optimization problems", 대한수학회지, 44(4), pp.971~985 (2007), 대한수학회
- L. Vandenberghe, "Semidefinite Programming", SIAM Review, 38, pp.49~95 (1996)