Interior Point Trajectories in Semidefinite Programming

DOI10.1137/S105262349630009XMaRDI QIDQ4229451zbMATHFDO

Authors Donald Goldfarb, Katya Scheinberg

Publication date 22 February 1999

Published in SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

interior point methodssemidefinite programmingcentral path

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on necessary conditions (49M05)

Recommendations

• On the central paths and Cauchy trajectories in semidefinite programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• Analysis of some interior point continuous trajectories for convex programming
• Analyticity of the central path at the boundary point in semidefinite programming

Cited in

(28)

• On the central path of semidefinite optimization: degree and worst-case convergence rate
• Euclidean distance matrices and applications
• On parametric semidefinite programming
• A block coordinate descent method for sensor network localization
• Analysis of some interior point continuous trajectories for convex programming
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Generating and measuring instances of hard semidefinite programs
• The convergent generalized central paths for linearly constrained convex programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• Dynamical system characterization of the central path and its variants -- a revisit
• Affine scaling algorithm fails for semidefinite programming
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• On the identification of the optimal partition for semidefinite optimization
• On the central paths and Cauchy trajectories in semidefinite programming
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
• \(LDL^T\) direction interior point method for semidefinite programming
• scientific article; zbMATH DE number 776096 (Why is no real title available?)
• A rounding procedure for semidefinite optimization
• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• On the complexity of analyticity in semi-definite optimization
• Analyticity of the central path at the boundary point in semidefinite programming
• Semi-definite programming and quantum information
• Convergence analysis of four interior point continuous trajectories for convex semidefinite programming
• Accelerated first-order methods for a class of semidefinite programs
• Theory of semidefinite programming for sensor network localization
• A note on the nonexistence of sum of squares certificates for the Bessis-Moussa-Villani conjecture

This page was built for publication: Interior Point Trajectories in Semidefinite Programming

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