An infeasible-interior-point predictor-corrector algorithm for linear programming

SIAM Journal on Optimization

Volumn 6, Issue 1, 1996, Pages 19-32

  Potra, Florian A ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Interior point methods, infeasible starting point; Linear program; Polynomial complexity

Indexed keywords

EID: 0030304765     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806002     Document Type: Article

References (6)

1. N. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
2. M. KOJIMA, N. MEGIDDO, AND S. MIZUNO, A primal-dual infeasible-interior-point algorithm for linear programming, Math. Programming, 61 (1993), pp. 263-280.
3. I. J. LUSTIG, R. E. MARSTEN, AND D. F. SHANNO, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl., 152 (1991), pp. 191-222.
4. S. MIZUNO, Polynomiality of Kojima-Megiddo-Mizuno infeasible interior point algorithm for linear programming, Tech. Report, School of OR and IE, Cornell University, Ithaca, NY, May 1992. (Revised July 1992.)
5. S. MIZUNO, M. J. TODD, AND Y. YE, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res., 18 (1993), pp. 964-981.
6. Y. ZHANG, On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem, SIAM J. Optim., 4 (1994), pp. 208-227.