Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
From MaRDI portal
Publication:837124
DOI10.1016/j.jmaa.2009.06.043zbMath1208.90134WikidataQ59241585 ScholiaQ59241585MaRDI QIDQ837124
Guoyin Li, Vaithilingam Jeyakumar
Publication date: 10 September 2009
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.06.043
90C25: Convex programming
90C46: Optimality conditions and duality in mathematical programming
90C34: Semi-infinite programming
Related Items
Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality, A complete characterization of strong duality in nonconvex optimization with a single constraint, A note on nonconvex minimax theorem with separable homogeneous polynomials, Strong duality and minimal representations for cone optimization, Stable zero Lagrange duality for DC conic programming, A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints, Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems, Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Universal duality in conic convex optimization
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Some convex programs without a duality gap
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Zero duality gaps in infinite-dimensional programming
- Existence of optimal solutions and duality results under weak conditions
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Necessary and sufficient conditions for stable conjugate duality
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- On duality theory of convex semi-infinite programming
- Strong Duality for Semidefinite Programming
- On the Closedness of the Linear Image of a Closed Convex Cone
- Handbook of semidefinite programming. Theory, algorithms, and applications
