Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
From MaRDI portal
Publication:4389181
DOI10.1137/S1052623496299187zbMath0910.90229OpenAlexW1588330761MaRDI QIDQ4389181
Zhi-Quan Luo, Jos F. Sturm, Shu-Zhong Zhang
Publication date: 12 May 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623496299187
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)
Related Items (38)
On the identification of the optimal partition for semidefinite optimization ⋮ A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY ⋮ Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems ⋮ A corrector–predictor path-following algorithm for semidefinite optimization ⋮ Exploiting sparsity in primal-dual interior-point methods for semidefinite programming ⋮ Error bounds in mathematical programming ⋮ Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs ⋮ Strong duality and minimal representations for cone optimization ⋮ Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step ⋮ On the complexity of analyticity in semi-definite optimization ⋮ Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming ⋮ A full NT-step infeasible interior-point algorithm for semidefinite optimization ⋮ $LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ Generating and measuring instances of hard semidefinite programs ⋮ Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ Product-form Cholesky factorization in interior point methods for second-order cone programming ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ An inexact primal-dual path following algorithm for convex quadratic SDP ⋮ A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming ⋮ Parametric analysis of semidefinite optimization ⋮ Characterizing the universal rigidity of generic frameworks ⋮ A new primal-dual path-following interior-point algorithm for semidefinite optimization ⋮ A new barrier for a class of semidefinite problems ⋮ Superlinear convergence of interior-point algorithms for semidefinite programming ⋮ Affine scaling algorithm fails for semidefinite programming ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ On weighted centers for semidefinite programming ⋮ Analyticity of the central path at the boundary point in semidefinite programming ⋮ Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method ⋮ Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants ⋮ On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization ⋮ Unnamed Item
This page was built for publication: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
