Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- 1 May 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 1 (2) , 268-279
- https://doi.org/10.1137/0801018
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Polynomial affine algorithms for linear programmingMathematical Programming, 1990
- On the convergence of the method of analytic centers when applied to convex quadratic programsMathematical Programming, 1990
- An O(n 3 L) primal interior point algorithm for convex quadratic programmingMathematical Programming, 1990
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Pathways to the Optimal Set in Linear ProgrammingPublished by Springer Nature ,1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989
- An Algorithm for Solving Linear Programming Problems in O(n 3 L) OperationsPublished by Springer Nature ,1989
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984