A Low Complexity Interior-Point Algorithm for Linear Programming

DOI10.1137/0802011MaRDI QIDQ4018391zbMATH OpenOpenAlexFDO

Authors Michael J. Todd

Publication date 16 January 1993

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/8786

zbMATH Keywords

affine scaling methodimproved lower boundsinterior point algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• An interior point method for linear programming
• scientific article; zbMATH DE number 4031392
• scientific article; zbMATH DE number 123966
• An Interior-Point Algorithm for Linearly Constrained Optimization
• scientific article; zbMATH DE number 409894
• scientific article; zbMATH DE number 1150439
• Interior proximal point algorithm for linear programs
• scientific article; zbMATH DE number 4164543
• scientific article; zbMATH DE number 1097715

Cited in

(22)

• Todd's low-complexity algorithm is a predictor-corrector path-following method
• A weighted least squares study of robustness in interior point linear programming
• A modified layered-step interior-point algorithm for linear programming
• Finding an interior point in the optimal face of linear programs
• A primal-dual affine-scaling potential-reduction algorithm for linear programming
• Some variants of the Todd low-complexity algorithm
• An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
• Superlinear convergence of the affine scaling algorithm
• Combining phase I and phase II in a potential reduction algorithm for linear programming
• An accelerated interior point method whose running time depends only on A (extended abstract)
• The modified interior point algorithm for linear optimization
• New interior point algorithms in linear programming
• Insights into the interior-point methods
• A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
• scientific article; zbMATH DE number 1349148 (Why is no real title available?)
• scientific article; zbMATH DE number 554743 (Why is no real title available?)
• A Primal-dual affine scaling algorithm with necessary centering as a safeguard
• scientific article; zbMATH DE number 1150439 (Why is no real title available?)
• A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
• A circular cone relaxation primal interior point algorithm for LP
• Symbolic decision procedure for termination of linear programs
• The complex interior-boundary method for linear and nonlinear programming with linear constraints

This page was built for publication: A Low Complexity Interior-Point Algorithm for Linear Programming

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