New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
From MaRDI portal
Publication:425803
DOI10.1016/j.na.2009.05.009zbMath1239.90084OpenAlexW2038056652WikidataQ59241581 ScholiaQ59241581MaRDI QIDQ425803
Guoyin Li, Vaithilingam Jeyakumar
Publication date: 9 June 2012
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.05.009
necessary and sufficient conditionsconvex programsconstraint qualificationssemidefinite programszero duality gaps
Related Items
Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems ⋮ Strong and total Fenchel dualities for robust convex optimization problems ⋮ Min-sup-type zero duality gap properties for DC composite optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex functions, monotone operators and differentiability.
- Some convex programs without a duality gap
- Zero duality gaps in infinite-dimensional programming
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- On strong and total Lagrange duality for convex optimization problems
- The strong conical hull intersection property for convex programming
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Closedness conditions for the optimality of a family of non-convex optimization problems
- A closedness condition and its applications to DC programs with convex constraints
- Strong Duality for Semidefinite Programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- Handbook of semidefinite programming. Theory, algorithms, and applications
