Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming
From MaRDI portal
Publication:3609101
zbMATH Open1174.90735MaRDI QIDQ3609101FDOQ3609101
Authors: Chengjin Li, Wenyu Sun 
Publication date: 6 March 2009
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
optimality conditionnonlinear semidefinite programmingFarkas lemmanonconvex semidefinite programming
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)
Cited In (8)
- 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
- On filter-successive linearization methods for nonlinear semidefinite programming
- On duality theory for non-convex semidefinite programming
- A filter method for nonlinear semidefinite programming with global convergence
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- Generalized separation theorems and the Farkas' lemma
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)
