Equivalence of two nondegeneracy conditions for semidefinite programs
From MaRDI portal
Publication:2483041
In semidefinite programming, a broad generalization of linear programming to the convex cone of positive semidefinite matrices, degenerate problems are typically difficult to solve: algorithms show slow convergence near the optimum, and computed solutions may be highly sensitive to perturbations. It is thus relevant to derive conditions for non-degeneracy. In this paper, the authors show that two previously available non-degeneracy conditions are actually equivalent.
Recommendations
- Complementarity and nondegeneracy in semidefinite programming
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- Local Duality of Nonlinear Semidefinite Programming
Cites work
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
- A sensitivity result for semidefinite programs.
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- An Interior-Point Method for Semidefinite Programming
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- Complementarity and nondegeneracy in semidefinite programming
- Conditioning of semidefinite programs
- Equivalence of two nondegeneracy conditions for semidefinite programs
- First and second order analysis of nonlinear semidefinite programs
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Matrix Analysis
- Merit functions for semi-definite complementarity problems
- Non-interior continuation methods for solving semidefinite complementarity problems
- On Eigenvalue Optimization
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Semismooth Matrix-Valued Functions
- Some structural properties of a Newton-type method for semidefinite programs
Cited in
(8)- A refined theorem concerning the conditioning of semidefinite programs
- Equivalence of two nondegeneracy conditions for semidefinite programs
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- An equivalent problem in nonconvex semidefinite programming
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- Weak notions of nondegeneracy in nonlinear semidefinite programming
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
This page was built for publication: Equivalence of two nondegeneracy conditions for semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483041)
