A new class of polynomial primal-dual methods for linear and semidefinite optimization
type: Item
instance of: scholarly article
title: A new class of polynomial primal-dual methods for linear and semidefinite optimization
zbMATH Open document ID: 1058.90037
DOI: 10.1016/S0377-2217(02)00275-8
author: Jiming Peng
author: C. Roos
author: Tamás Terlaky
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1832942
zbMATH Keywords: Linear optimization
zbMATH Keywords: Semidefinite optimization
zbMATH Keywords: Interior point method
zbMATH Keywords: Primal-dual Newton method
zbMATH Keywords: Polynomialcomplexity
MaRDI profile type: Publication
cites work: Q4347846
cites work: Q4040931
cites work: An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
cites work: Primal-dual algorithms for linear programming based on the logarithmic barrier method
cites work: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
cites work: A new polynomial-time algorithm for linear programming
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Q4206561
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Finding an interior point in the optimal face of linear programs
cites work: A primal-dual affine-scaling potential-reduction algorithm for linear programming
cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: New complexity analysis of the primal-dual Newton method for linear optimization
cites work: Q4339096
cites work: Q3738934
cites work: Symmetric primal-dual path-following algorithms for semidefinite programming
cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming
cites work: On the Nesterov--Todd Direction in Semidefinite Programming
cites work: Q5691079
cites work: On the finite convergence of interior-point algorithms for linear programming
cites work: Q4382667
cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
cites work: Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
full work available at URL: s0377-2217(02)00275-8
OpenAlex ID: W1969136247
description: scientific article; zbMATH DE number 1832942