Equivalence of two nondegeneracy conditions for semidefinite programs

DOI10.1007/S10957-007-9270-5MaRDI QIDQ2483041zbMATH OpenOpenAlexFDO

Authors M. L. Flegel, Christian Kanzow

Publication date 5 May 2008

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-007-9270-5

zbMATH Keywords

semidefinite programmingdualityoptimality conditions

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Semidefinite programming (90C22)

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

• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1534289 (Why is no real title available?)
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
• A sensitivity result for semidefinite programs.
• 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
• 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)

• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• An equivalency condition of nonsingularity in nonlinear semidefinite programming
• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
• Equivalence of two nondegeneracy conditions for semidefinite programs
• An equivalent problem in nonconvex semidefinite programming
• A refined theorem concerning the conditioning of semidefinite programs
• Weak notions of nondegeneracy in nonlinear semidefinite programming
• Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in 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)