On the Convergence of the Central Path in Semidefinite Optimization

DOI10.1137/S1052623401390793zbMath1035.90100MaRDI QIDQ4785863

Etienne de Klerk, Cornelis Roos, Margaréta Halická

Publication date: 5 January 2003

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

zbMATH Keywords

interior point methodsemidefinite optimizationlinear optimizationanalytic centercentral path

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (37)

On the central paths in symmetric cone programming ⋮ On the identification of the optimal partition for semidefinite optimization ⋮ Embedding methods for semidefinite programming ⋮ A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization ⋮ Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials ⋮ Unnamed Item ⋮ Strong duality and minimal representations for cone optimization ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization ⋮ On the complexity of analyticity in semi-definite optimization ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A class of new search directions for full-NT step feasible interior point method in semidefinite optimization ⋮ Generating and measuring instances of hard semidefinite programs ⋮ Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory ⋮ The Convergent Generalized Central Paths for Linearly Constrained Convex Programming ⋮ On some properties and an application of the logarithmic barrier method ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming ⋮ On the volumetric path ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ A note on treating a second order cone program as a special case of a semidefinite program ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ Interior proximal methods and central paths for convex second-order cone programming ⋮ A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming ⋮ A rounding procedure for semidefinite optimization ⋮ An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood ⋮ Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds ⋮ A new barrier for a class of semidefinite problems ⋮ A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization ⋮ On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ A relaxed logarithmic barrier method for 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 ⋮ On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach

This page was built for publication: On the Convergence of the Central Path in Semidefinite Optimization