New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
DOI10.1016/J.NA.2009.05.009zbMATH Open1239.90084OpenAlexW2038056652WikidataQ59241581 ScholiaQ59241581MaRDI QIDQ425803FDOQ425803
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
Recommendations
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Constraint qualifications and zero duality gap properties in conical programming involving composite functions
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- scientific article; zbMATH DE number 1552283
- Strong Duality for Semidefinite Programming
constraint qualificationssemidefinite programsnecessary and sufficient conditionsconvex programszero duality gaps
Cites Work
- Title not available (Why is that?)
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex functions, monotone operators and differentiability.
- Title not available (Why is that?)
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Title not available (Why is that?)
- Farkas-type results and duality for DC programs with convex constraints
- A closedness condition and its applications to DC programs with convex constraints
- A dual condition for the convex subdifferential sum formula with applications
- Constraint qualifications for semi-infinite systems of convex inequalities
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- On strong and total Lagrange duality for convex optimization problems
- Strong Duality for Semidefinite Programming
- Zero duality gaps in infinite-dimensional programming
- The strong conical hull intersection property for convex programming
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- Some convex programs without a duality gap
Cited In (9)
- Universal duality in conic convex optimization
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Strong and total Fenchel dualities for robust convex optimization problems
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Min-sup-type zero duality gap properties for DC composite optimization problem
- Stable zero Lagrange duality for DC conic programming
- 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
- Title not available (Why is that?)
This page was built for publication: New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425803)
