Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
From MaRDI portal
Publication:4210332
DOI10.1137/S1052623496308618zbMath0913.65052MaRDI QIDQ4210332
Publication date: 21 September 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
convergencesemidefinite programminginterior-point methodspolynomial complexitypath-following methodsprimal-dual methods
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)
Related Items
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, A method for weighted projections to the positive definite cone, A feasible primal-dual interior point method for linear semidefinite programming, A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming, A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization, A new second-order corrector interior-point algorithm for semidefinite programming, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, On the extension of an arc-search interior-point algorithm for semidefinite optimization, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, Equivalence of two nondegeneracy conditions for semidefinite programs, Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization, A relaxed logarithmic barrier method for semidefinite programming, A study of search directions in primal-dual interior-point methods for semidefinite programming, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming, Semidefinite programming
