Convergence of a class of inexact interior-point algorithms for linear programs

Mathematics of Operations Research

Volumn 24, Issue 1, 1999, Pages 50-71

  Freund, Roland W ^a   Jarre, Florian ^b   Mizuno, Shinji ^c  

^a NOKIA RESEARCH CENTER   (United States)

^b UNIVERSITY OF WÜRZBURG   (Germany)

^c INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING;

INEXACT INTERIOR-POINT ALGORITHMS;

OPERATIONS RESEARCH;

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

References (22)

1. Andersen, E. D., K. D. Andersen (1995). Presolving in linear programming. Math. Programming 71 221-245.
2. Fourer, R., S. Mehrotra (1993). Solving symmetric indefinite systems in an interior-point method for linear programming. Math. Programming 62 15-39.
3. Freund, R. W., F. Jarre (1996a). A QMR-based interior-point algorithm for solving linear programs. Math. Programming 76 183-210.
4. _, _, S. Mizuno (1996b). Convergence of a class of inexact interior-point algorithms for linear programs. Numerical Analysis Manuscript 96-16, Bell Laboratories, Murray Hill, New Jersey.
5. _, _ (1999). Numerical experiences with a QMR-based interior-point algorithm for linear programs. Numerical Analysis Manuscript, Bell Laboratories, Murray Hill, New Jersey, in preparation.
6. _, N. M. Nachtigal (1991). QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math. 60 315-339.
7. Gay, D. M. (1985). Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter 13 10-12.
8. Gondzio, J., T. Terlaky (1994). A computational view of interior-point methods for linear programming. Report 94-73, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft.
9. Karmarkar, N. K. (1984). A new polynomial-time algorithm for linear programming. Combinatorica 4 373-395.
10. Kojima, M., N. Megiddo, S. Mizuno (1993). A primal-dual infeasible-interior-point algorithm for linear programming. Math. Programming 61 263-280.
11. _, S. Mizuno, A. Yoshise (1989). 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.
12. 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.
13. _, _, _ (1992). On implementing Mehrotra's predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2 435-449.
14. Megiddo, N. (1989). Pathways to the optimal set in linear programming. N. Megiddo, ed., Progress in Mathematical Programming, Interior-Point and Related Methods, Springer-Verlag, New York, 131-158.
15. Mizuno, S. (1994). Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Programming 67 109-119.
16. _, F. Jarre (1996a). An infeasible-interior-point algorithm using projections onto a convex set. Ann. Oper. Res. 62 59-80.
17. _, _ (1996b). Global and polynomial-time Convergence of an infeasible-interior-point algorithm using inexact computation. Research Memorandum 605, The Institute of Statistical Mathematics, Tokyo.
18. Monteiro, R. D. C., I. Adler (1989). Interior path following primal-dual algorithms, Part I: Linear programming. Math. Programming 44 27-41.
19. Portugal, L. F., M. G. C. Resende, G. Veiga, J. J. Judice (1994). A truncated primal-infeasible dual-feasible interior point network flow method. Technical Report, AT&T Bell Laboratories, Murray Hill, NJ. Revised version, 1996.
20. Stoer, J., R. Bulirsch (1993). Introduction to Numerical Analysis, Second Edition. Springer-Verlag, New York.
21. Tanabe, K. (1988). Centered Newton method for mathematical programming. M. Iri, K. Yajima, eds., System Modelling and Optimization, Springer-Verlag, New York, 197-206.
22. Vanderbei, R. J., T. J. Carpenter (1993). Symmetric indefinite systems for interior point methods. Math. Programming 58 1-32.