Necessary and sufficient conditions for Farkas' Lemma for cone systems and second-order cone programming duality

zbMATH Open1245.90141MaRDI QIDQ5447472FDOQ5447472

Authors:

Publication date: 6 March 2008

Full work available at URL: http://www.heldermann.de/JCA/JCA15/JCA151/jca15005.htm

Recommendations

• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
• Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
• Farkas-type results and duality for DC programs with convex constraints
• Strong duality in cone constrained nonconvex optimization

zbMATH Keywords

strong dualitysecond-order cone programmingFarkas Lemmaclosed cone conditioncone-convex systems

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cited In (8)

• Approximate optimality conditions for composite convex optimization problems
• Farkas' lemma: three decades of generalizations for mathematical optimization
• Vector topical functions and Farkas type theorems with applications
• Functional inequalities and theorems of the alternative involving composite functions
• Some dual characterizations of Farkas-type results for fractional programming problems
• Farkas-type theorems and applications: from IPH functions to ICR functions
• Sequential optimality theorems for second-order cone linear fractional vector optimization problems
• Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems

This page was built for publication: Necessary and sufficient conditions for Farkas' Lemma for cone systems and second-order cone programming duality

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