An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
type: Item
instance of: scholarly article
title: An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
zbMATH Open document ID: 0853.90085
DOI: 10.1007/BF02592088
published in: Mathematical Programming. Series A. Series B
publication date: 1996-10-17T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 912379
zbMATH Keywords: primal-dual interior point algorithm
zbMATH Keywords: polynomiality
zbMATH Keywords: primal-dual affine scaling method
zbMATH Keywords: primal-dual central path
author: Jos F. Sturm
author: Shuzhong Zhang
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: A survey of search directions in interior point methods for linear programming
cites work: Q5583564
cites work: Q5588268
cites work: A primal projective interior point method for linear programming
cites work: Conical projection algorithms for linear programming
cites work: Search directions for interior linear-programming methods
cites work: The largest step path following algorithm for monotone linear complementarity problems
cites work: Q5540119
cites work: A new variant of the primal affine scaling algorithm for linear programs
cites work: A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
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: Q3491304
cites work: A primal-dual affine-scaling potential-reduction algorithm for linear programming
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Interior path following primal-dual algorithms. I: 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: Q4739657
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: New complexity results for the Iri-Imai method
cites work: Global convergence of the affine scaling methods for degenerate linear programming problems
cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
cites work: Constant potential primal-dual algorithms: A framework
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
full work available at URL: https://doi.org/10.1007/bf02592088
OpenAlex ID: W1498125507
Recommended article: An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
Recommended article: A primal-dual affine-scaling potential-reduction algorithm for linear programming
Recommended article: A new variant of the primal affine scaling algorithm for linear programs
Recommended article: Q4547212
Recommended article: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
Recommended article: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
Recommended article: Q4545873
Recommended article: Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
Recommended article: A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
Recommended article: On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
description: scientific article; zbMATH DE number 912379