Some convex programs without a duality gap
From MaRDI portal
Publication:959958
DOI10.1007/s10107-007-0110-zzbMath1176.90464OpenAlexW2062932190MaRDI QIDQ959958
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0110-z
Related Items
Duality theorems for separable convex programming without qualifications ⋮ Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications ⋮ Further study on strong Lagrangian duality property for invex programs via penalty functions ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ New strong duality results for convex programs with separable constraints ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ Stable zero Lagrange duality for DC conic programming ⋮ A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ Characterizing robust set containments and solutions of uncertain linear programs without qualifications ⋮ Farkas' lemma for separable sublinear inequalities without qualifications ⋮ Duality gap of the conic convex constrained optimization problems in normed spaces ⋮ Extended monotropic programming and duality ⋮ On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
Cites Work
- Stochastic programming duality: \({\mathcal L}^\infty\) multipliers for unbounded constraints with an application to mathematical finance
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Convex analysis and nonlinear optimization. Theory and examples
- Existence of optimal solutions and duality results under weak conditions
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Duality gap in convex programming
- Ordinary convex programs without a duality gap
- A sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Proximal Minimization Methods with Generalized Bregman Functions
- Convex Analysis
- An ϵ-Out-of-Kilter Method for Monotropic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
