Constraint qualifications characterizing Lagrangian duality in convex optimization
From MaRDI portal
Recommendations
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- A constraint qualification for convex programming
- scientific article; zbMATH DE number 222537
- Convergence of Lagrange Multipliers and Dual Variables for Convex Optimization Problems
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Una caracterización dual de optimalidad para optimización convexa
- On constraint qualifications of a nonconvex inequality
- scientific article; zbMATH DE number 1960859
Cites work
- 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
- A simple closure condition for the normal cone intersection formula
- An alternative formulation for a new closed cone constraint qualification
- Generalizations of Slater's constraint qualification for infinite convex programs
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 1552283 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Inequality systems and global optimization
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong Duality for Semidefinite Programming
- The strong conical hull intersection property for convex programming
Cited in
(42)- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Approximate optimality conditions for composite convex optimization problems
- Convex and convex-like optimization over a range inclusion problem and first applications
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Some constraint qualifications for quasiconvex vector-valued systems
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function
- Weighted robust optimality of convex optimization problems with data uncertainty
- Duality theorems for convex and quasiconvex set functions
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- Optimality conditions and constraint qualifications 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
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- scientific article; zbMATH DE number 4049394 (Why is no real title available?)
- Necessary and sufficient constraint qualification for surrogate duality
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Error bounds and multipliers in constrained optimization problems with tolerance
- Strong and total Lagrange dualities for quasiconvex programming
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- Strong duality in robust semi-definite linear programming under data uncertainty
- Optimality conditions and total dualities for conic programming involving composite function
- scientific article; zbMATH DE number 6729884 (Why is no real title available?)
- New strong duality results for convex programs with separable constraints
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for generalized convex programming problems under data uncertainty
- On the uniform duality in copositive optimization
- Revisiting some rules of convex analysis
- Optimality conditions and Lagrange dualities for optimization problems involving _c-convex functions
- Conic relaxations for conic minimax convex polynomial programs with extensions and applications
- Local optimality conditions and local saddle point theorems for nonconvex robust programming
- Functional inequalities and theorems of the alternative involving composite functions
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
This page was built for publication: Constraint qualifications characterizing Lagrangian duality in convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1956463)
