DOI QR코드

DOI QR Code

ON OPTIMALITY THEOREMS FOR SEMIDEFINITE LINEAR VECTOR OPTIMIZATION PROBLEMS

  • Kim, Moon Hee (College of General Education Tongmyong University)
  • Received : 2018.06.11
  • Accepted : 2018.07.08
  • Published : 2021.09.30

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.

Keywords

References

  1. R.S. Burachik and V. Jeyakumar, Dual condition for the convex subdifferential sum formula with applications, J. Con. Analy., 12(2005), 279-290.
  2. Etienne de Klerk, "Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications", Kluwer Academic Publishers, 2002.
  3. A.M. Geoffrion, Proper efficiency and the theory of vector optimization, Journal of Mathematical Analysis and Applications, Vol. 22(1968), 618-630. https://doi.org/10.1016/0022-247X(68)90201-1
  4. G.Y. Li, V. Jeyakumar and G.M. Lee, Robust conjugate duality for convex optimization under uncertainty with application to data classification, Nonlinear Anal., 74(2011), 2327-2341. https://doi.org/10.1016/j.na.2010.11.036
  5. J. Jahn, "Introduction to the Theory of Nonlinear Optimization", Springer-Verlag Berlin, 2007.
  6. J. Jeyakumar, G. M. Lee and N. Dinh, New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs, SIAM J. Optim., 14 (2003), 534-547. https://doi.org/10.1137/S1052623402417699
  7. M. H. Kim, G. S. Kim and G. M. Lee, On semidefinite linear fractional optimization problems, to appear in J. Nonlinear and Convex Anal..
  8. G. M. Lee and K. B. Lee, On optimality conditions for abstract convex vector optimization problems, J. Korean Math. Soc,, 44 (2007), 971-985. https://doi.org/10.4134/JKMS.2007.44.4.971
  9. L. Vandenberghe and S. Boyd, Semidefinite Programming, SIAM Review, 38 (1996), 49-95. https://doi.org/10.1137/1038003