Interior Point Trajectories in Semidefinite Programming

DOI10.1137/S105262349630009XMaRDI QIDQ4229451zbMATH OpenFDO

Authors Donald Goldfarb, Katya Scheinberg

Publication date 22 February 1999

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

Full work available at URL https://doi.org/10.1137/S105262349630009X

zbMATH Keywords

central pathinterior point methodssemidefinite programming

Mathematics Subject Classification ID

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

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

(29)

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

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)