A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
From MaRDI portal
Publication:4018386
DOI10.1137/0802006zbMath0763.90064MaRDI QIDQ4018386
Cornelis Roos, Jean-Philippe Vial, Dick den Hertog
Publication date: 16 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0802006
90C60: Abstract computational complexity for mathematical programming problems
90C05: Linear programming
Related Items
A long-step barrier method for convex quadratic programming, A build-up variant of the logarithmic barrier method for LP, On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise, An interior point method, based on rank-1 updates, for linear programming, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Degeneracy in interior point methods for linear programming: A survey, Primal-dual algorithms for linear programming based on the logarithmic barrier method, A logarithmic barrier cutting plane method for convex programming