Equivalence of two nondegeneracy conditions for semidefinite programs

DOI10.1007/s10957-007-9270-5zbMath1155.90011OpenAlexW2073383430MaRDI QIDQ2483041

Christian Kanzow, M. L. Flegel

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 programmingoptimality conditionsduality

Mathematics Subject Classification ID

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

Related Items (2)

Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming ⋮ Equivalence of two nondegeneracy conditions for semidefinite programs

Cites Work

• Unnamed Item
• Unnamed Item
• Some structural properties of a Newton-type method for semidefinite programs
• Merit functions for semi-definite complementarity problems
• Complementarity and nondegeneracy in semidefinite programming
• First and second order analysis of nonlinear semidefinite programs
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Non-interior continuation methods for solving semidefinite complementarity problems
• A sensitivity result for semidefinite programs.
• Conditioning of semidefinite programs
• Equivalence of two nondegeneracy conditions for semidefinite programs
• Matrix Analysis
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• 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
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
• On Eigenvalue Optimization
• An Interior-Point Method for Semidefinite Programming
• Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
• Semismooth Matrix-Valued Functions
• An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming

This page was built for publication: Equivalence of two nondegeneracy conditions for semidefinite programs