Constraint qualifications characterizing Lagrangian duality in convex optimization
From MaRDI portal
Publication:1956463
DOI10.1007/s10957-007-9294-xzbMath1194.90069OpenAlexW2039745024MaRDI QIDQ1956463
Publication date: 22 September 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9294-x
Related Items (35)
Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ 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 ⋮ Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Weighted robust optimality of convex optimization problems with data uncertainty ⋮ Convex and convex-like optimization over a range inclusion problem and first applications ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ Some constraint qualifications for quasiconvex vector-valued systems ⋮ A complete characterization of strong duality in nonconvex optimization with a single constraint ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Robust duality for generalized convex programming problems under data uncertainty ⋮ Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty ⋮ Revisiting some rules of convex analysis ⋮ A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ Strong duality in robust semi-definite linear programming under data uncertainty ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Generalizations of Slater's constraint qualification for infinite convex programs
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Inequality systems and global optimization
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- The strong conical hull intersection property for convex programming
- An alternative formulation for a new closed cone constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Strong Duality for Semidefinite Programming
- A simple closure condition for the normal cone intersection formula
This page was built for publication: Constraint qualifications characterizing Lagrangian duality in convex optimization
