Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming |
| |
Authors: | N Dinh V Jeyakumar G M Lee |
| |
Institution: | (1) Associate Professor, Department of Mathematics and Computer Science, University of Pedagogy, Ho Chi Minh City, Vietnam;(2) Pukyong National University, Pusan, Korea;(3) Head, Department of Applied Mathematics, University of New South Wales, Sydney, NSW, Australia;(4) Professor, Department of Applied Mathematics, Pukyong National University, Pusan, Korea |
| |
Abstract: | In this paper it is shown that, in the absence of any regularity condition, sequential Lagrangian optimality conditions as well as a sequential duality results hold for abstract convex programs. The significance of the results is that they yield the standard optimality and duality results for convex programs under a simple closed-cone condition that is much weaker than the well-known constraint qualifications. As an application, a sequential Lagrangian duality, saddle-point conditions, and stability results are derived for convex semidefinite programs.The authors are grateful to the referee and Professor Franco Giannessi for valuable comments and constructive suggestions which have contributed to the final preparation of the paper. |
| |
Keywords: | Sequential Lagrangian conditions duality constraint qualifications semidefinite programs |
本文献已被 SpringerLink 等数据库收录! |
|