Complete characterizations of stable Farkas' lemma and cone-convex programming duality
From MaRDI portal
Publication:927159
DOI10.1007/s10107-007-0104-xzbMath1145.90074OpenAlexW1975585047WikidataQ124879278 ScholiaQ124879278MaRDI QIDQ927159
Vaithilingam Jeyakumar, Gue Myung Lee
Publication date: 4 June 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0104-x
Convex optimizationSecond-order cone programmingSemi-definite programmingStable dualityStable Farkas lemma
Nonlinear programming (90C30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)
Related Items
Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ Strong duality and minimal representations for cone optimization ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ A complete characterization of strong duality in nonconvex optimization with a single constraint ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ Strong duality in robust semi-definite linear programming under data uncertainty ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ Exact relaxations for parametric robust linear optimization problems ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
Cites Work
- On weak * closedness, coerciveness, and inf-sup theorems
- Applications of second-order cone programming
- A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
- Second-order cone programming
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Inequality systems and global optimization
- The strong conical hull intersection property for convex programming
- An alternative formulation for a new closed cone constraint qualification
- Characterizations of solution sets of convex vector minimization problems
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Results of farkas type
- Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
- Notes on Duality in Second Order and p -Order Cone Optimization
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- Farkas-Type Results With Conjugate Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
