Asymptotic behavior of the central path for a special class of degenerate SDP problems

DOI10.1007/S10107-004-0555-2MaRDI QIDQ2487847zbMATH OpenOpenAlexFDO

Authors Renato D. C. Monteiro, J. X. da Cruz Neto, O. P. Ferreira

Publication date 8 August 2005

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

Full work available at URL https://doi.org/10.1007/s10107-004-0555-2

zbMATH Keywords

Central pathConvex quadratic programmingConvex quadratically constrained programmingLimiting behaviorSemidefinite programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22)

Recommendations

• Limiting behavior of the central path in semidefinite optimization
• Analyticity of the central path at the boundary point in semidefinite programming
• Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• On the central paths in symmetric cone programming

Cites work

• A simple characterization of solutions sets of convex programs
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• Analytical properties of the central path at boundary point in linear programming
• Analyticity of the central path at the boundary point in semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
• General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
• scientific article; zbMATH DE number 3788387 (Why is no real title available?)
• scientific article; zbMATH DE number 1182578 (Why is no real title available?)
• scientific article; zbMATH DE number 1534296 (Why is no real title available?)
• scientific article; zbMATH DE number 4197741 (Why is no real title available?)
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Interior Point Trajectories in Semidefinite Programming
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
• Limiting behavior of weighted central paths in linear programming
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
• On the Convergence of the Central Path in Semidefinite Optimization
• On the existence and convergence of the central path for convex programming and some duality results
• On two interior-point mappings for nonlinear semidefinite complementarity problems
• Properties of an Interior-Point Mapping for Mixed Complementarity Problems
• Singular Points of Complex Hypersurfaces. (AM-61)
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• The analyticity of interior-point-paths at strictly complementary solutions of linear programs
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Two simple proofs for analyticity of the central path in linear programming.

Cited in

(12)

• On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
• On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
• Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
• \(LDL^T\) direction interior point method for semidefinite programming
• Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• On the central path of semidefinite optimization: degree and worst-case convergence rate
• On the complexity of analyticity in semi-definite optimization
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
• Analyticity of weighted central paths and error bounds for semidefinite programming

This page was built for publication: Asymptotic behavior of the central path for a special class of degenerate SDP problems

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