Analyticity of weighted central paths and error bounds for semidefinite programming

DOI10.1007/s10107-007-0155-zzbMath1219.90122OpenAlexW2096423097MaRDI QIDQ948959

Chek Beng Chua

Publication date: 16 October 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10220/5855

zbMATH Keywords

semidefinite programmingerror boundweighted analytic centerhomogeneous cone programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Related Items (3)

A Lipschitzian error bound for monotone symmetric cone linear complementarity problem ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity

Cites Work

• Unnamed Item
• Unnamed Item
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
• Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Complementarity and nondegeneracy in semidefinite programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• On weighted centers for semidefinite programming
• Analyticity of the central path at the boundary point in semidefinite programming
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
• Error Bounds for Linear Matrix Inequalities
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
• Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
• A New Notion of Weighted Centers for Semidefinite Programming
• Two simple proofs for analyticity of the central path in linear programming.

This page was built for publication: Analyticity of weighted central paths and error bounds for semidefinite programming