On a special class of regularized central paths for semidefinite programs

DOI10.1007/s10107-008-0241-xzbMath1196.90092OpenAlexW2029501157MaRDI QIDQ847845

Anhua Lin

Publication date: 19 February 2010

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

Full work available at URL: https://doi.org/10.1007/s10107-008-0241-x

zbMATH Keywords

projectionpath-following algorithmsemidefinite programregularized central path

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the long-step path-following method for semidefinite programming
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
• On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
• Analyticity of the central path at the boundary point in semidefinite programming
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
• High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
• Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists
• On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems
• Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
• A High-Order Path-Following Method for Locating the Least 2-Norm Solution of Monotone LCPs
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Global Error Bounds for Convex Conic Problems
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Two simple proofs for analyticity of the central path in linear programming.
• \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods
• High order long-step methods for solving linear complementarity problems

This page was built for publication: On a special class of regularized central paths for semidefinite programs