New complexity results for the Iri-Imai method
type: Item
instance of: scholarly article
title: New complexity results for the Iri-Imai method
zbMATH Open document ID: 0848.90091
DOI: 10.1007/BF02206829
published in: Annals of Operations Research
publication date: 1996-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 894996
zbMATH Keywords: Iri-Imai algorithm
zbMATH Keywords: primal-dual potential function
author: Jos F. Sturm
author: Shuzhong Zhang
MaRDI profile type: Publication
cites work: A combined phase I-phase II scaled potential algorithm for linear programming
cites work: Q5583564
cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start''
cites work: Polynomial affine algorithms for linear programming
cites work: Interior point algorithms for linear programming with inequality constraints
cites work: Path-Following Methods for Linear Programming
cites work: Q5540119
cites work: A multiplicative barrier function method for linear programming
cites work: A proof of the polynomiality of the Iri-Imai method
cites work: A new polynomial-time algorithm for linear programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q3738934
cites work: Potential reduction method for harmonically convex programming
cites work: A Centered Projective Algorithm for Linear Programming
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
full work available at URL: https://doi.org/10.1007/bf02206829
OpenAlex ID: W2049374005
description: scientific article; zbMATH DE number 894996