A QMR-based interior-point algorithm for solving linear programs

Mathematical Programming, Series B

Volumn 76, Issue 1, 1997, Pages 183-210

  Freund, Roland W ^a   Jarre, Florian ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Indefinite preconditioner; Interior point method; Linear program; Quasi minimal residual iteration; Symmetric indefinite linear system

Indexed keywords

EID: 0038951788     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614383     Document Type: Article

References (31)

1. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, "An implementation of Karmarkar's algorithm for linear programming," Mathematical Programming 44 (1989) 297-335.
2. O. Axelsson, "A survey of preconditioned iterative methods for linear systems of algebraic equations," BIT 25 (1985) 166-187.
3. J.R. Bunch and B.N. Parlett, "Direct methods for solving symmetric indefinite systems of linear equations," SIAM Journal on Numerical Analysis 8 (1971) 639-655.
4. S.C. Eisenstat, "Efficient implementation of a class of preconditioned conjugate gradient methods," SIAM Journal on Scientific and Statistical Computing 2 (1981) 1-4.
5. R. Fourer and S. Mehrotra, "Solving symmetric indefinite systems in an interior-point method for linear programming," Mathematical Programming 62 (1993) 15-39.
6. R.W. Freund, "Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations," in: D. Braess and L. Schumaker, eds., Numerical Methods of Approximation Theory (Birkhaüser, Basel, 1992) pp. 77-95.
7. R.W. Freund, "Transpose-free quasi-minimal residual methods for non-Hermitian linear systems," in: G. Golub, A. Greenbaum, and M. Luskin, eds., Recent Advances in Iterative Methods, The IMA Volumes in Mathematics and its Applications, Vol. 60 (Springer, New York, 1994) pp. 69-94.
8. R.W. Freund, G.H. Golub and N.M. Nachtigal, "Iterative solution of linear systems," Acta Numerica 1 (1992) 57-100.
9. R.W. Freund, M.H. Gutknecht and N.M. Nachtigal, "An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices," SIAM Journal on Scientific Computing 14 (1993) 137-158.
10. R.W. Freund, F. Jarre and S. Mizuno, "Convergence of a class of inexact interior-point algorithms for linear programs," Numerical Analysis Manuscript 96-16, Bell Laboratories, Murray Hill, NJ (1996).
11. R.W. Freund and F. Jarre, "Numerical experiences with a QMR-based interior-point algorithm for linear programs," Numerical Analysis Manuscript, Bell Laboratories, Murray Hill, NJ (1996), in preparation.
12. R.W. Freund and N.M. Nachtigal, "QMR: A quasi-minimal residual method for non-Hermitian linear systems," Numerische Mathematik 60 (1991) 315-339.
13. R.W. Freund and N.M. Nachtigal, "An implementation of the QMR method based on coupled two-term recurrences," SIAM Journal on Scientific Computing 15 (1994) 313-337.
14. R.W. Freund and T. Szeto, "A transpose-free quasi-minimal residual squared algorithm for non-Hermitian linear systems," in: R. Vichnevetsky, D. Knight and G. Richter, eds., Advances in Computer Methods for Partial Differential Equations - VII (IMACS, New Brunswick, NJ, 1992) pp. 258-264.
15. R.W. Freund and H. Zha, "Simplifications of the nonsymmetric Lanczos process and a new algorithm for Hermitian indefinite linear systems," AT & T Numerical Analysis Manuscript, Bell Laboratories, Murray Hill, NJ (1995).
16. D.M. Gay, "Electronic mail distribution of linear programming test problems," Mathematical Programming Society COAL Newsletter 13 (1985) 10-12.
17. P.E. Gill, W. Murray, D.B. Ponceleón and M.A. Saunders, "Preconditioners for indefinite systems arising in optimization," SIAM Journal on Matrix Analysis and Applications 13 (1992) 292-311.
18. M.R. Hestenes and E. Stiefel, "Methods of conjugate gradients for solving linear systems," Journal of Research of the National Bureau of Standards 49 (1952) 409-436.
19. N.K. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica 4 (1984) 373-395.
20. N.K. Karmarkar and K.G. Ramakrishnan, "Computational results of an interior point algorithm for large scale linear programming," Mathematical Programming 52 (1991) 555-586.
21. M. Kojima, N. Megiddo and S. Mizuno, "A primal-dual infeasible-interior-point algorithm for linear programming," Mathematical Programming 61 (1993) 263-280.
22. M. Kojima, S. Mizuno and A. Yoshise, "A primal-dual interior point algorithm for linear programming," in: N. Megiddo, ed., Progress in Mathematical Programming, Interior-Point and Related Methods (Springer, New York, 1989) pp. 29-47.
23. I.J. Lustig, R.E. Marsten and D.F. Shanno, "Computational experience with a primal-dual interior point method for linear programming," Linear Algebra and its Applications 152 (1991) 191-222.
24. I.J. Lustig, R.E. Marsten and D.F. Shanno, "On implementing Mehrotra's predictor-corrector interior-point method for linear programming," SIAM Journal on Optimization 2 (1992) 435-449.
25. N. Megiddo, "Pathways to the optimal set in linear programming," in: N. Megiddo, ed., Progress in Mathematical Programming, Interior-Point and Related Methods (Springer, New York, 1989) pp. 131-158.
26. J. Menniken, "Implementation of a primal-dual path following method for solving large linear programs," Dissertation, Fakultät für Mathematik und Informatik, Universität Würzburg, Würzburg, Germany (1991).
27. R.D.C. Monteiro and I. Adler, "Interior path following primal-dual algorithms, Part I: Linear programming," Mathematical Programming 44 (1989) 27-41.
28. C.C. Paige and M.A. Saunders, "Solution of sparse indefinite systems of linear equations," SIAM Journal on Numerical Analysis 12 (1975) 617-629.
29. K. Tanabe, "Centered Newton method for mathematical programming," in: M. Iri and K. Yajima, eds., System Modelling and Optimization (Springer, New York, 1988) pp. 197-206.
30. R.J. Vanderbei and T.J. Carpenter, "Symmetric indefinite systems for interior point methods," Mathematical Programming 58 (1993) 1-32.
31. X. Xu, P.P. Hung and Y. Ye, "A simplified homogeneous and self-dual linear programming algorithm and its implementation," Working Paper, College of Business Administration, The University of Iowa, Iowa City, IA (1993).