A refined theorem concerning the conditioning of semidefinite programs
From MaRDI portal
Recommendations
- Conditioning of semidefinite programs
- Optimality conditions in semidefinite programming
- A condition number theorem in convex programming
- Equivalence of two nondegeneracy conditions for semidefinite programs
- Optimality conditions for nonconvex semidefinite programming
- Sufficient optimality conditions for convex semi-infinite programming
- Explicit optimality conditions for convex semi-infinite programming problems
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Strong duality conditions in semidefinite programming
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
Cites work
- Complementarity and nondegeneracy in semidefinite programming
- Conditioning of semidefinite programs
- scientific article; zbMATH DE number 3822549 (Why is no real title available?)
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- On the Newton-Kantorovich hypothesis for solving equations
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
This page was built for publication: A refined theorem concerning the conditioning of semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454984)