| 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.
DOI
|
| 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.
DOI
|
| 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.
DOI
|
| 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 |
L. Vandenberghe and S. Boyd, Semidefinite Programming, SIAM Review, 38 (1996), 49-95.
DOI
|
| 9 |
G. M. Lee and K. B. Lee, On optimality conditions for abstract convex vector optimization problems, J. Korean Math. Soc,, 44 (2007), 971-985.
DOI
|
webmaster
