Pages that link to "Item:Q1956463"
From MaRDI portal
The following pages link to Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463):
Displaying 35 items.
- Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
- Necessary and sufficient constraint qualification for surrogate duality (Q415371) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- A complete characterization of strong duality in nonconvex optimization with a single constraint (Q454276) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- New strong duality results for convex programs with separable constraints (Q613429) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
- Robust duality for generalized convex programming problems under data uncertainty (Q654075) (← links)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Functional inequalities and theorems of the alternative involving composite functions (Q743970) (← links)
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
- Approximate optimality conditions for composite convex optimization problems (Q1689064) (← links)
- Convex and convex-like optimization over a range inclusion problem and first applications (Q1693857) (← links)
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
- Some constraint qualifications for quasiconvex vector-valued systems (Q1945503) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2022228) (← links)
- Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function (Q2053413) (← links)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
- Optimality conditions and constraint qualifications for quasiconvex programming (Q2278888) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q2336429) (← links)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
- Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance (Q4624931) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q5088817) (← links)
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system (Q5110313) (← links)
- Strong duality in robust semi-definite linear programming under data uncertainty (Q5169452) (← links)
- Optimality conditions and total dualities for conic programming involving composite function (Q5213372) (← links)