An interior point method, based on rank-1 updates, for linear programming
type: Item
instance of: scholarly article
title: An interior point method, based on rank-1 updates, for linear programming
zbMATH Open document ID: 0919.90110
DOI: 10.1007/BF01584845
author: Jos F. Sturm
author: Shuzhong Zhang
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1294656
zbMATH Keywords: linear programming
zbMATH Keywords: interior point method
zbMATH Keywords: potential function
zbMATH Keywords: polynomial time primal-dual potential reduction algorithm
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3033554
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
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: Q4296156
cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
cites work: O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
cites work: Q5750715
cites work: On Mizuno’s Rank-One Updating Algorithm for Linear Programming
cites work: A Centered Projective Algorithm for Linear Programming
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
cites work: DEFERRED RANK ONE UPDATES IN O(n_3L) INTERIOR POINT ALGORITHM
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Computing Karmarkar projections quickly
description: scientific article; zbMATH DE number 1294656