A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting points
- 1 October 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 67 (1) , 383-406
- https://doi.org/10.1007/bf01582228
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear ProgrammingMathematics of Operations Research, 1993
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 1993
- A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programmingMathematical Programming, 1993
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984