Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming

Numerical Algorithms

Volumn 25, Issue 1-4, 2000, Pages 387-406

  Wang, Weichung ^a   O'Leary, Dianne P ^b  

^a Department of Mathematics Education   (Taiwan)

^b University of Maryland ^*  (United States)

Author keywords

Adaptive algorithms; Interior point methods; Iterative methods for linear systems; Linear programming; Self timing algorithms

Indexed keywords

EID: 0034560396     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1016614603137     Document Type: Article

References (41)

1. E.D. Andersen, J. Gondzio, C. Mészáros and X. Xu, Implementation of interior point methods for large scale linear programming, Technical Report 1996.3, Logilab, HEC Geneva, Section of Management Studies, University of Geneva, Switzerland (January 1997).
2. R. Bartels and L. Kaufman, Cholesky factor updating techniques for rank 2 matrix modifications, SIAM J. Matrix Anal. Appl. 10(4) (1989) 557-592.
3. T.J. Carpenter and D.F. Shanno, An interior point method for quadratic programs based on conjugate projected gradients, Comput. Optim. Appl. 2 (1993) 5-28.
4. P. Chin and A. Vannelli, Computational methods for an LP model of the placement problem, Technical Report UWE&CE-94-02, Department of Electrical and Computer Engineering, University of Waterloo (November 1994).
5. P. Chin and A. Vannelli, Iterative methods for the augmented equations in large-scale linear programming, Technical Report UWE&CE-94-01, Department of Electrical and Computer Engineering, University of Waterloo (October 1994).
6. I.C. Choi, C.L. Monma and D.F. Shanno, Further development of a primal-dual interior point method, ORSA J. Comput. 2(4) (1990) 304-311.
7. J. Czyzyk, S. Mehrotra and S.J. Wright, PCx user guide, Technical Report ANL/MCS-TM-217, Argonne National Laboratory, Argonne, IL (1997).
8. J.J. Dongarra, J.R. Bunch, C.B. Moler and G.W Stewart, LINPACK User's Guide (SIAM, Philadelphia, PA, 1979).
9. I.S. Duff, A.M. Erisman and J.K. Reid, Direct Methods for Sparse Matrices (Clarendon Press, Oxford, 1986).
10. A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968). Reprint: SIAM Classics in Applied Mathematics, Vol. 4 (SIAM Philadelphia, PA, 1990).
11. A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968). Reprint: SIAM Classics in Applied Mathematics, Vol. 4 (SIAM Philadelphia, PA, 1990).
12. R.W. Freund and F. Jarre, A QMR-based interior-point algorithm for solving linear programs, Technical Report, AT&T Bell Laboratories and Institut für Angewandte Mathematik und Statistik (1995).
13. M. Frigo and S.G. Johnson, The fastest Fourier transform in the west, Technical Report MIT-LCS-TR-728, Massachusetts Institute of Technology (September 1997).
14. D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Soc. COAL Newsletter (1985).
15. P.E. Gill and W. Murray, Newton-type methods for unconstrained and linearly constrained optimization, Math. Programming 7 (1974) 311-350.
16. P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Math. Programming 36 (1986) 183-209.
17. P.E. Gill, W Murray and M.H. Wright, Practical Optimization (Academic Press, New York, 1981).
18. D. Goldfarb and S. Mehrotra, A relaxed version of Karmarkar's method, Math. Programming 40(3) (1988) 289-315.
19. G.H. Golub and C.F. Van Loan, Matrix Computations, 2nd ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1989).
20. C.C. Gonzaga, Path-following methods for linear programming, SIAM Rev. 34(2) (1992) 167-224.
21. N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
22. N.K. Karmarkar and K.G. Ramakrishnan, Computational results of an interior point algorithm for large scale linear programming, Math. Programming 52 (1991) 555-586.
23. J.L. Kennington and R.V. Helgason, Algorithms for Network Programming (Wiley, New York, 1980).
24. D. Klingman, A. Napier and J. Stutz, NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems, Managm. Sci. 20(5) (1974) 814-821.
25. J. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Software 11 (1985) 141-153.
26. I.J. Lustig, R.E. Marsten and D.F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl. 152 (1991) 191-222.
27. I.J. Lustig, R.E. Marsten and D.F. Shanno, On implementing Mehrotra's predictor-corrector interior-point method for linear programming, SIAM J. Optim. 2(3) (1992) 435-449.
28. I.J. Lustig, R.E. Marsten and D.F. Shanno, Interior point methods for linear programming: Computational state of the art, ORSA J. Comput. 6(1) (1994) 1-14.
29. S. Mehrotra, Implementation of affine scaling methods: Approximate solutions of systems of linear equations using preconditioned conjugate gradient methods, ORSA J. Comput. 4(2) (1992) 103-118.
30. S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM J. Optim. 2(4) (1992) 575-601.
31. S. Mehrotra and J.-S. Wang, Conjugate gradient based implementation of interior point methods for network flow problems, Technical Report 95-70.1, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL (October 1995).
32. S.G. Nash and A. Sofer, Preconditioning of reduced matrices, Technical Report 93-01, Department of Operations Research and Engineering, George Mason University, Fairfax, VA (February 1993).
33. E. Ng and B.W. Peyton, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Comput. 14 (1993) 1034-1056.
34. C.C. Paige and M.A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software 8 (1982) 43-71.
35. L.F. Portugal, M.G.C. Resende, G. Veiga and J.J. Júdice, A truncated primal-infeasible dual-feasible network interior point method (November 1994).
36. R.J. Vanderbei, LOQO : An interior point code for quadratic programming, Program in Statistics and Operations Research, Princeton University, rvdb@princeton.edu (1995).
37. R.S. Varga, Factorization and normalized iterative methods, in: Boundary Problems in Differential Equations, ed. R.E. Langer (Univ. of Wisconsin Press, Madison, 1960) pp. 121-142.
38. W. Wang, Iterative methods in interior point methods for linear programming, Ph.D. thesis, Applied Mathematics Program, University of Maryland (1996).
39. W. Wang and D.P. O'Leary, Adaptive use of iterative methods in interior point methods for linear programming, Technical Report CS-TR-3560, Computer Science Department, University of Maryland (November 1995); http://www.cs.umd.edu/Dienst/UI/2-0/Describe/ncstrl.umcp/CS-TR-3560.
40. R.C. Whaley and J.J. Dongarra, Automatically tuned linear algebra software, in: SC 1998 Proceedings (IEEE Press, New York, 1998) (electronic publication); http://www.netlib.org/utk/people/JackDongarra/papers.html.
41. M.H. Wright, Interior methods for constrained optimization, in: Acta Numerica 1992, ed. A. Iserles (Cambridge Univ. Press, New York, 1992) pp. 341-407.