Interior Point Trajectories in Semidefinite Programming
From MaRDI portal
Publication:4229451
DOI10.1137/S105262349630009XzbMath0914.90215MaRDI QIDQ4229451
Donald Goldfarb, Katya Scheinberg
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on necessary conditions (49M05)
Related Items
A block coordinate descent method for sensor network localization, On the identification of the optimal partition for semidefinite optimization, THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS, Initialization in semidefinite programming via a self-dual skew-symmetric embedding, Theory of semidefinite programming for sensor network localization, On the complexity of analyticity in semi-definite optimization, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, Generating and measuring instances of hard semidefinite programs, A polynomial primal-dual affine scaling algorithm for symmetric conic optimization, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Euclidean Distance Matrices and Applications, A rounding procedure for semidefinite optimization, Semidefinite characterization and computation of zero-dimensional real radical ideals, Affine scaling algorithm fails for semidefinite programming, On parametric semidefinite programming, Analyticity of the central path at the boundary point in semidefinite programming, A note on the nonexistence of sum of squares certificates for the Bessis–Moussa–Villani conjecture, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
