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.043zbMATH Open1208.90134OpenAlexW2089042254WikidataQ59241585 ScholiaQ59241585MaRDI QIDQ837124FDOQ837124
Authors: V. Jeyakumar, G. Li 
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
Recommendations
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Zero duality gap for a class of nonconvex optimization problems
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
- scientific article; zbMATH DE number 1552283
- On zero duality gap in nonconvex quadratic programming problems
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Zero duality gap property for convex composite optimization problems
- A Nonconvex Duality with Zero Gap and Applications
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Conditions for zero duality gap in convex programming
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Cites Work
- 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?)
- Title not available (Why is that?)
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Existence of optimal solutions and duality results under weak conditions
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- On the Closedness of the Linear Image of a Closed Convex Cone
- Strong Duality for Semidefinite Programming
- Necessary and sufficient conditions for stable conjugate duality
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Zero duality gaps in infinite-dimensional programming
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Some convex programs without a duality gap
- On duality theory of convex semi-infinite programming
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Universal duality in conic convex optimization
Cited In (19)
- A note on nonconvex minimax theorem with separable homogeneous polynomials
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- On epsilon-stability in optimization
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- Universal duality in conic convex optimization
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems
- On duality gap with polynomial multipliers for polynomial optimization problems
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Strong duality and minimal representations for cone optimization
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Exact relaxations for parametric robust linear optimization problems
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- Convexity and closedness in stable robust duality
- Min-sup-type zero duality gap properties for DC composite optimization problem
- Stable zero Lagrange duality for DC conic programming
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
This page was built for publication: Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837124)
