Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming

MaRDI QIDQ3609101zbMATH OpenFDO

Authors Chengjin Li, Wenyu Sun

Publication date 6 March 2009

zbMATH Keywords

Farkas lemmanonconvex semidefinite programmingnonlinear semidefinite programmingoptimality condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)

Recommendations

• Generalized separation theorems and the Farkas' lemma
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• Optimality conditions for nonconvex semidefinite programming
• On duality theory for non-convex semidefinite programming
• The optimality conditions and duality theory for multiobjective semidefinite programming

Cited in

(8)

• On filter-successive linearization methods for nonlinear semidefinite programming
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• Generalized separation theorems and the Farkas' lemma
• Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
• A qualification free sequential Pshenichnyi-Rockafellar lemma and convex semidefinite
• A filter method for nonlinear semidefinite programming with global convergence
• A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
• On duality theory for non-convex semidefinite programming

This page was built for publication: Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609101)