An interior point method, based on rank-1 updates, for linear programming

DOI10.1007/BF01584845zbMath0919.90110MaRDI QIDQ1290600

Jos F. Sturm, Shu-Zhong Zhang

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear programminginterior point methodpotential functionpolynomial time primal-dual potential reduction algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Interior Point Methods for Nonlinear Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
• Computing Karmarkar projections quickly
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• Long steps in an \(O(n^ 3L)\) algorithm for linear programming
• On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
• A Centered Projective Algorithm for Linear Programming
• A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
• On Mizuno’s Rank-One Updating Algorithm for Linear Programming
• DEFERRED RANK ONE UPDATES IN O(n_3L) INTERIOR POINT ALGORITHM