New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
From MaRDI portal
(Redirected from Publication:425803)
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
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A closedness condition and its applications to DC programs with convex constraints
- A dual condition for the convex subdifferential sum formula with applications
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- 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
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for semi-infinite systems of convex inequalities
- Convex functions, monotone operators and differentiability.
- Farkas-type results and duality for DC programs with convex constraints
- Handbook of semidefinite programming. Theory, algorithms, and applications
- 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
- On strong and total Lagrange duality for convex optimization problems
- Some convex programs without a duality gap
- Strong Duality for Semidefinite Programming
- The strong conical hull intersection property for convex programming
- Zero duality gaps in infinite-dimensional programming
Cited in
(13)- scientific article; zbMATH DE number 1552283 (Why is no real title available?)
- Universal duality in conic convex optimization
- Projection: A unified approach to semi-infinite linear programs and duality in convex programming
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- 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
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- 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
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
- Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs
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)
