Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure

Journal of Complexity

Volumn 18, Issue 3, 2002, Pages 833-910

  Huhn, Petra ^a   Borgwardt, Karl Heinz ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Interior point methods; Linear programming; Probabilistic analysis

Indexed keywords

EID: 0036749189     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2002.0640     Document Type: Article

References (22)

1. I. Adler and N. Megiddo, A simplex algorithm whose average number of between two quadratic functions of the smaller dimension, J. Assoc. (1985), 871-895.
2. I. Adler, N. Megiddo, and M. J. Todd, New results on the average behavior algorithms, Bull. Amer. Math. Soc. 11 (1984), 378-382.
3. K. M. Anstreicher, J. Ji, F. A. Potra, and Y. Ye, Average performance of interior-point algorithm for linear programming, in "Complexity in Optimization," (P. M. Pardalos, Ed), pp. 1-15, World Scientific 1993.
4. K. M. Anstreicher, J. Ji, F. A. Potra, and Y. Ye, Probabilistic analysis primal-dual algorithm for linear programming, Math. Oper. Res. 24 (1999), 176-192.
5. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, "Nonlinear programming, algorithms," 2nd ed., Wiley-Interscience Series in Discrete Mathematics Wiley, New York, 1993.
6. K. H. Borgwardt, "The Simplex Method-A Probabilistic Analysis," Heidelberg, 1987.
7. K. H. Borgwardt, Ideas leading to a better bound on the average number of solving an LP, in "Operations Research Proceedings 1997," pp. 1-12, Berlin, 1998; GOR-Tagung, Jena.
8. K. H. Borgwardt, A sharp upper bound for the expected number of under orthogonal projection on two-dimension planes. Math. Oper. Res. (1999), 925-984.
9. D. den Hertog, "Interior Point Approach to Linear, Quadratic and Convex Algorithms and Complexity," Mathematics and its Applications, Vol. 277, Academic Publishers, Dordrecht, 1994.
10. P. Huhn, "Schranken für die durchschnittliche Laufzeit des Innere-Punkte-Verfahren," Ph.D. dissertation, Universität Augsburg, Mathematisch-naturwissenschaftliche Schriften, Bd. 16.
11. P. Huhn, A phase-1-algorithm for interior-point-methods: Worst-case and behaviour, in "Operations Research Proceedings 1998," pp. 103-112, Berlin, 1999; GOR-Conference, Zurich.
12. P. Huhn, and K. H. Borgwardt, An upper bound for the average number of required in phase II of an interior-point-method, in "Operations 1997," pp. 19-24, Springer-Verlag, Berlin, 1998; GOR-Conference, Jena.
13. N. K. Karmarkar, A new polynomial-time algorithm for linear programming. 26 (1984), 373-395.
14. S. Mehrotra and Y. Ye, Finding an interior point in the optimal face of Math. Programm. 62A (1993), 497-515.
15. S. Mizuno, M. J. Todd, and Y. Ye, On adaptive-step primal-dual for linear programming, Math. Oper. Res. 18 (1993), 964-981.
16. C. H. Papadimitriou and K. Steiglitz, "Combinatorial Optimization," Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
17. S. Smale, On the average number of steps of the simplex method, Math. (1983), 241-262.
18. M. J. Todd, Polynomial expected behavior of a pivoting algorithm for complementarity and linear programming problems, Math. Program. 35 (1986), 173-192.
19. M. J. Todd, Probabilistic models for linear programming, Math. Oper. Res. (Erratum, 23 767-768).
20. M. J. Todd, L. Tuncel and Y. Ye, Characterizations, bounds and two complexity measures for linear programming, Math. Programm. 90 (2001), 59-69.
21. Y. Ye, Toward probabilistic analysis of interior-point algorithms for Math. Oper. Res. 19 (1994), 38-52.
22. Y. Ye, "Interior Point Algorithms: Theory and Analysis," York, 1997.