On a wide region of centers and primal-dual interior point algorithms for linear programming

Mathematics of Operations Research

Volumn 22, Issue 2, 1997, Pages 408-431

  Sturm, Jos F ^a   Zhang, Shuzhong ^a  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Central path; Linear programming; Primal dual interior point method; Wide neighborhood

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ITERATIVE METHODS; POLYNOMIALS; PROBLEM SOLVING;

ADAPTIVE STEP METHODOLOGY; NEWTON METHODOLOGY; PRIMAL DUAL INTERIOR POINT METHOD;

LINEAR PROGRAMMING;

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

References (17)

1. Blum, M., R. W. FLoyd, V. Pratt, R. L. Rivest, R. E. Tarjan (1973). Time bounds for selection. J. Comput. System Sci. 7 448-461.
2. Gay, D. M. (1985). Electronic mail distribution of linear programming test problems. Math. Programming Soc. COAL Newsletter 13 10-12.
3. Jansen, B., C. Roos, T. Terlaky, J.-Ph. Vial (1993). Primal-dual target-following algorithms for linear programming. Report 93-107, Faculty of Technical Mathematics and Informatics, Technical University Delft, The Netherlands.
4. Karmarkar, N. K. (1984). A new polynomial-time algorithm for linear programming. Combinatorica 4 373-395.
5. Kojima, M., N. Megiddo, T. Noma, A. Yoshise (1991). A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer-Verlag, Berlin.
6. _, S. Mizuno, A. Yoshise (1988). A primal-dual interior point algorithm for linear programming. N. Megiddo, ed. Progress in Mathematical Programming: Interior-Point and Related Methods, Springer-Verlag, New York, 29-47,
7. _, _, _ (1989). A polynomial algorithm for a class of linear complementarity problems. Math. Programming 44 1-26.
8. Lustig, I. J., R. E. Marsten, D. F. Shanno (1991). Computational experience with a primal-dual interior point method for linear programming. Linear Algebra Appl. 152 191-222.
9. _, _, _ (1992). On implementing Mehrotra's predictor-corrector interior point method for linear programming. SIAM J. Optim. 2 435-449.
10. Mehrotra, S. (1992). On the implementation of a primal-dual interior point method. SIAM J. Optim. 2 575-601.
11. _, Y. Ye (1993). Finding an interior point in the optimal face of linear programs. Math. Programming 62 497-515.
12. Mizuno, S., M. J. Todd, Y. Ye (1993). On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18 964-981.
13. Rockafellar, R. T. (1970). Convex Analysis, Princeton University Press, Princeton.
14. Sturm, J. F., S. Zhang (1996). An θ(√n L) iteration bound primal-dual cone affine scaling algorithm for linear programming. Math. Programming 72 177-194.
15. Xu, X. (1994). An θ(√n L)-iteration large-step infeasible path-following algorithm for linear programming, College of Business Administration, The University of Iowa, Iowa City.
16. _, P-F. Hung, Y. Ye (1994). A simplified and self-dual linear programming algorithm and its implementation, College of Business Administration, The University of Iowa, Iowa City.
17. Ye, Y., M. J. Todd, S. Mizuno (1994). An θ(√n L)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19 53-67.