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

DOI10.1007/BF01584845MaRDI QIDQ1290600zbMATH OpenFDO

Authors Jos F. Sturm, Shuzhong 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)

Recommendations

• scientific article; zbMATH DE number 4185392
• DEFERRED RANK ONE UPDATES IN O(n_3L) INTERIOR POINT ALGORITHM
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• scientific article; zbMATH DE number 4197744

Cites work

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

Cited in

(7)

• On first experiences with the implementation of a Newton based linear programming approach
• Primal-dual path-following methods and the trust-region updating strategy for linear programming with noisy data
• An efficient basis update for asymptotic linear programming
• On Mizuno’s Rank-One Updating Algorithm for Linear Programming
• scientific article; zbMATH DE number 4185392 (Why is no real title available?)
• A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
• Interior Point Methods for Nonlinear Optimization

This page was built for publication: An interior point method, based on rank-1 updates, for linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290600)