On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
type: Item
instance of: scholarly article
title: On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
zbMATH Open document ID: 0764.90052
DOI: 10.1007/BF01188712
author: Robert A. Bosch
author: Kurt M. Anstreicher
published in: Algorithmica
publication date: 1993-04-01T00:00:00Z
review text: This paper is concerned with improving the efficiency of the primal-dual potential reduction approach to linear programming of \textit{M. Kojima, S. Mizuno} and \textit{A. Yoshise} [Math. Program., Ser. A 50, No. 3, 331-342 (1991; Zbl 0738.90077)]with the use of partial updating. Various theoretical complexity results are established. Experimental results are not provided.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 148918
zbMATH Keywords: interior-point method
zbMATH Keywords: primal-dual potential reduction approach
zbMATH Keywords: partial updating
reviewed by: Thomas F. Coleman
MaRDI profile type: Publication
cites work: A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
cites work: Long steps in an \(O(n^ 3L)\) algorithm for linear programming
cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
cites work: An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3491304
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming
cites work: Q4206561
cites work: An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Computing Karmarkar projections quickly
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
full work available at URL: https://doi.org/10.1007/bf01188712
OpenAlex ID: W2050681410
description: scientific article; zbMATH DE number 148918