On a special class of regularized central paths for semidefinite programs

DOI10.1007/S10107-008-0241-XMaRDI QIDQ847845zbMATH OpenOpenAlexFDO

Authors 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

projectionsemidefinite programpath-following algorithmregularized central path

Mathematics Subject Classification ID

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

Recommendations

• On the central path for nonlinear semidefinite programming
• On the central paths and Cauchy trajectories in semidefinite programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• On the Convergence of the Central Path in Semidefinite Optimization
• On the central paths in symmetric cone programming
• Existence, uniqueness, and convergence of the regularized primal-dual central path
• Limiting behavior of the central path in semidefinite optimization
• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
• Limiting behaviour and analyticity of weighted central paths in semidefinite programming
• On the central path of semidefinite optimization: degree and worst-case convergence rate

Cites work

• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 635657 (Why is no real title available?)
• scientific article; zbMATH DE number 2158989 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A High-Order Path-Following Method for Locating the Least 2-Norm Solution of Monotone LCPs
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• Analyticity of the central path at the boundary point in semidefinite programming
• Global Error Bounds for Convex Conic Problems
• Handbook of semidefinite programming. Theory, algorithms, and applications
• High order infeasible-interior-point methods for solving sufficient linear complementarity problems
• High order long-step methods for solving linear complementarity problems
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• Locating the least 2-norm solution of linear programs via a path-following method
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• On a new homotopy continuation trajectory for nonlinear complementary problems.
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
• On the long-step path-following method for semidefinite programming
• On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
• On two interior-point mappings for nonlinear semidefinite complementarity problems
• Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
• Two simple proofs for analyticity of the central path in linear programming.
• \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods

Cited in

(4)

• On the Convergence of the Central Path in Semidefinite Optimization
• Optimizing over the growing spectrahedron
• scientific article; zbMATH DE number 1265013 (Why is no real title available?)
• Projection onto the solution set of semidefinite programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847845)