A refined theorem concerning the conditioning of semidefinite programs

DOI10.1007/BF02832319zbMath1149.90155MaRDI QIDQ2454984

Ioannis K. Argyros

Publication date: 22 October 2007

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

perturbation theorysemidefinite programmingNewton-Kantorovich theorem/hypothesis

Mathematics Subject Classification ID

Convex programming (90C25) Newton-type methods (49M15) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Error analysis and interval analysis (65G99)

Cites Work

• Complementarity and nondegeneracy in semidefinite programming
• Conditioning of semidefinite programs
• On the Newton-Kantorovich hypothesis for solving equations
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Unnamed Item
• Unnamed Item

This page was built for publication: A refined theorem concerning the conditioning of semidefinite programs