A Low Complexity Interior-Point Algorithm for Linear Programming

DOI10.1137/0802011zbMath0811.90070OpenAlexW2044219297MaRDI QIDQ4018391

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

interior point algorithmaffine scaling methodimproved lower bounds

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Superlinear convergence of the affine scaling algorithm, Some variants of the Todd low-complexity algorithm, Todd's low-complexity algorithm is a predictor-corrector path-following method, Symbolic decision procedure for termination of linear programs, A circular cone relaxation primal interior point algorithm for LP, Finding an interior point in the optimal face of linear programs, A primal-dual affine-scaling potential-reduction algorithm for linear programming