Probabilistic analysis of an infeasible-interior-point algorithm for linear programming

Mathematics of Operations Research

Volumn 24, Issue 1, 1999, Pages 176-192

  Anstreicher, Kurt M ^a   Ji, Jun ^b   Potra, Florian A ^a   Ye, Yinyu ^a  

^a UNIVERSITY OF IOWA   (United States)

^b VALDOSTA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBABILITY;

FINITE TERMINATION METHOD; INFEASIBLE-INTERIOR-POINT ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0033076102     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.1.176     Document Type: Article

References (30)

1. Anstreicher, K. M. 1989. A combined phase I-phase II projective algorithm for linear programming. Math. Programming 43 209-223.
2. _ 1991. A combined phase I-phase II scaled potential algorithm for linear programming. Math. Programming 52 429-439.
3. _, J. Ji, F. A. Potra, Y. Ye 1992a. Average performance of a self-dual interior point algorithm for linear programming. P. Pardalos, ed. Complexity in Numerical Optimization. World Scientific, Singapore, 1-15.
4. _, _, Y. Ye 1992b. Average performance of an ellipsoid termination criterion for linear programming interior point algorithms. Working paper 92-1, Dept. of Management Sciences, University of Iowa, Iowa City, IA.
5. Bonnans, J. F., F. A. Potra 1994. Infeasible path following algorithms for linear complementarity problems. Reports on Computational Mathematics 63, Dept. of Mathematics, University of Iowa, Iowa City, IA.
6. Freund, R. M. 1996. An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution. Ann. Oper. Res. 62 29-58.
7. Girko, V. L. 1974. On the distribution of solution of systems of linear equations with random coefficients. Theor. Probability Math. Statist. 2 41-44.
8. Huang, S., Y. Ye 1991. On the average number of iterations of the polynomial interior-point algorithms for linear programming. Working paper 91-16, Dept. of Management Sciences, University of Iowa, Iowa City, IA.
9. Ishihara, T., M. Kojima 1993. On the big M in the affine scaling algorithm. Math. Programming 62 85-93.
10. Ji, J., F. A. Potra 1992. On the average complexity of finding an ∈-optimal solution for linear programming. Reports on Computational Mathematics No. 25, Dept. of Mathematics, University of Iowa, Iowa City, IA.
11. Kojima, M., N. Megiddo, S. Mizuno 1993. A primal-dual infeasible-interior-point algorithm for linear programming. Math. Programming 61 263-280.
12. _, S. Mizuno, A. Yoshise 1993. A little theorem of the big M in interior point algorithms. Math. Programming 59 361-376.
13. Lustig, I. J., R. E. Marsten, D. F. Shanno 1991. Computational experience with a primal-dual interior point method for linear programming. Linear Algebra and its Applications 152 191-222.
14. Mehrotra, S., Y. Ye 1993. Finding an interior point in the optimal face of linear programs. Math. Programming 62 497-515.
15. Mizuno, S. 1994. Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Programming 67 109-119.
16. _, M. Kojima, M. J. Todd 1995. Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming. SIAM J. Optim. 5 52-67.
17. _, M. J. Todd, Y. Ye 1993. On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18 964-981.
18. Potra, F. A. 1994. A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Programming 67 383-406.
19. _ 1996. An infeasible interior-point predictor-corrector algorithm for linear programming. SIAM J. Optim. 6 19-32.
20. Todd, M. J. 1991. Probabilistic models for linear programming. Math. Oper. Res. 16 671-693. Erratum 23 767-768.
21. _ 1992. On Anstreicher's combined phase I-phase II projective algorithm for linear programming. Math. Programming 55 1-15.
22. _ 1993. Combining phase I and phase II in a potential reduction algorithm for linear programming. Math. Programming 59 133-150.
23. Wright, S. J. 1994. An infeasible interior point algorithm for linear complementarity problems. Math. Programming 67 29-52.
24. _, Y. Zhang 1996. A superquadratic infeasible-interior-point algorithm for linear complementarity problems. Math. Programming 73 269-289.
25. Ye, Y. 1992. On the finite convergence of interior-point algorithms for linear programming. Math. Programming 57 325-335.
26. _ 1994. Towards probabilistic analysis of interior-point algorithms for linear programming. Math. Oper. Res. 19 38-52.
27. _ 1997. Interior Point Algorithms: Theory and Analysis. Wiley-Interscience, New York.
28. _, M. J. Todd, S. Mizuno 1994. An O(√nL)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19 53-67.
29. Zhang, Y. 1994. On the convergence of a class of infeasible interior-point algorithms for the horizontal linear complementarity problem. SIAM J. Optim. 4 208-227.
30. _, D. Zhang 1994. Superlinear convergence of infeasible-interior-point methods for linear programming. Math. Programming 66 361-377.