Convergence of an infeasible interior-point algorithm from arbitrary positive starting points

SIAM Journal on Optimization

Volumn 6, Issue 2, 1996, Pages 316-325

  Billups, Stephen C ^a   Ferris, Michael C ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Global convergence; Infeasible interior point methods; Linear complementarity

Indexed keywords

EID: 0030303835     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806018     Document Type: Article

References (24)

1. K. ANSTREICHER, A combined phase I-phase II protective algorithm for linear programming, Math. Programming, 43 (1989), pp. 209-223.
2. K. ANSTREICHER, A combined phase I-phase II scaled potential algorithm for linear programming, Math. Programming, 52 (1991), pp. 429-440.
3. S. C. BILLUPS AND M. C. FERRIS, Convergence of infeasible interior-point algorithms from arbitrary starting points, Tech. report 1180, Computer Sciences Department, University of Wisconsin, Madison, WI, 1993.
4. R. W. COTTLE, J. S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, Boston, 1992.
5. S. P. DIRKSE AND M. C. FERRIS, MCPLIB: A collection of nonlinear mixed complementarity problems, Optim. Meth. Software, 5 (1995), pp. 319-345.
6. _, A pathsearch damped Newton method for computing general equilibria, Mathematical Programming Tech. report 94-03, Computer Sciences Department, University of Wisconsin, Madison, WI, 1994.
7. O. GÜLER, Generalized linear complementarity problems, Math. Oper. Res., 20 (1995), pp. 441-448.
8. M. KOJIMA, N. MEGGIDO, AND S. MIZUNO, A primal-dual exterior point algorithm for linear programming, Tech. report RJ 8500, IBM Alamaden Research Center, San Jose, CA, 1991.
9. M. KOJIMA, S. MIZUNO, AND M. TODD, Infeasible interior-point primal-dual potential-reduction algorithms for linear programming, Tech. report 1023, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1992.
10. I. LUSTIG, R. MARSTEN, AND D. SHANNO, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl., 152 (1991), pp. 191-222.
11. _, On implementing Mehrotra's predictor-corrector interior point method for linear programming, SIAM J. Optim., 2 (1992), pp. 435-449.
12. K. MCSHANE, C. MONMA, AND D. SHANNO, An implementation of a primal-dual interior point method for linear programming, ORSA J. Comput., 1 (1989), pp. 70-83.
13. S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
14. S. MIZUNO, Polynomiality of Kojima-Meggido-Mizuno infeasible-interior-point algorithm for linear programming, Tech. report 1006, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1993.
15. R. D. C. MONTEIRO AND S. J. WRIGHT, A superlinear infeasible-interior-point affine scaling algorithm for LCP, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1993, preprint MCS-P361-0693.
16. F. A. POTRA, An infeasible interior-point predictor-corrector algorithm for linear programming, Tech. Report 26, Department of Mathematics, University of Iowa, Iowa City, IA, 1992.
17. _, On a predictor-corrector method for solving linear programs from infeasible starting points, Reports on Computational Mathematics 34, Department of Mathematics, University of Iowa, Iowa City, IA, 1992.
18. _, A quadratically convergent infeasible interior-point algorithm for linear programming, Tech. report 28, Department of Mathematics, University of Iowa, Iowa City, IA, 1992.
19. F. A. POTRA AND R. SHENG, A modified O (nL) infeasible-interior-point algorithm for LCP with quadratic convergence, Reports on Computational Mathematics 54, Department of Mathematics, University of Iowa, Iowa City, IA, 1994.
20. S. J. WRIGHT, A path-following infeasible-interior-point algorithm for linear complementarity problems, Optim. Meth. Software, 2 (1993), pp. 79-106.
21. _, A path-following interior-point algorithm for linear and quadratic problems, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1993, preprint MCS-P401-1293.
22. _, An infeasible-interior-point algorithm for linear complementarity problems, Math. Programming, 67 (1994), pp. 29-51.
23. 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.
24. Y. ZHANG AND D. ZHANG, Superlinear convergence of infeasible interior-point methods for linear programming, Tech. report 92-15, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD, 1992.