Interior Point Trajectories in Semidefinite Programming
From MaRDI portal
Publication:4229451
DOI10.1137/S105262349630009XzbMATH Open0914.90215MaRDI QIDQ4229451FDOQ4229451
Authors: Donald Goldfarb, Katya Scheinberg
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on necessary conditions (49M05)
Cited In (25)
- Euclidean Distance Matrices and Applications
- Analyticity of the central path at the boundary point in semidefinite programming
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- Title not available (Why is that?)
- Semi-definite programming and quantum information
- $LDL^T$ Direction Interior Point Method for Semidefinite Programming
- Affine scaling algorithm fails for semidefinite programming
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
- A block coordinate descent method for sensor network localization
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- 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
- On the central paths and Cauchy trajectories in semidefinite programming
- A rounding procedure for semidefinite optimization
- A note on the nonexistence of sum of squares certificates for the Bessis–Moussa–Villani conjecture
- Generating and measuring instances of hard semidefinite programs
- On the identification of the optimal partition for semidefinite optimization
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
- On parametric semidefinite programming
- Accelerated first-order methods for a class of semidefinite programs
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
- On the complexity of analyticity in semi-definite optimization
- Dynamical system characterization of the central path and its variants -- a revisit
- A polynomial primal-dual affine scaling algorithm for symmetric conic 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)