Pages that link to "Item:Q2465563"
From MaRDI portal
The following pages link to A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions (Q2465563):
Displaying 12 items.
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Duality for nonsmooth semi-infinite programming problems (Q691458) (← links)
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
- On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- An exact explicit dual for the linear copositive programming problem (Q2679002) (← links)
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification (Q4785878) (← links)
- Generalized robust duality in constrained nonconvex optimization (Q4986415) (← links)
- OPTIMAL CONTROL OF SEMILINEAR HIGHER-ORDER DIFFERENTIAL INCLUSIONS (Q5057840) (← links)
- Strong duality in robust semi-definite linear programming under data uncertainty (Q5169452) (← links)
