The role of the augmented system in interior point methods

European Journal of Operational Research

Volumn 107, Issue 3, 1998, Pages 720-736

  Maros, István ^a,b,c   Mészáros, Csaba ^a,b  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

^c IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Augmented system; Interior point methods; Linear programming

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

AUGMENTED SYSTEMS; INTERIOR POINT METHODS;

LINEAR PROGRAMMING;

EID: 0032098605     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00074-X     Document Type: Article

References (27)

1. M. Arioli, I.S. Duff, P.P.M. Rijk, On the augmented system approach to sparse least-squares problems, Numerische Mathematik 55 (1989) 667-684.
2. J.R. Birge, R.M. Freund, R.J. Vanderbei, Prior reduced fillin solving equations in interior point algorithms, Operations Research Letters 11 (1992) 195-198.
3. R.E. Bixby, Progress in Linear Programming, ORSA Journal en Computing 6 (1) (1994) 15-22.
4. I Duff, N.I.M. Gould, J. Reid, J.A. Scott, K. Turner, The factorization of sparse symmetric indefinite matrices, IMA Journal of Numerical Analysis 11 (1991) 181-204.
5. R. Fourer, S. Mehrotra, Solving symmetric indefinite systems in an interior point method for linear programming, Mathematical Programming 62 (1993) 15-39.
6. D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Society COAL Newsletter 13 (1985) 10-12.
7. J Gondzio, Splitting dense columns of constraint matrix in interior point methods for large scale linear programming, Optimization 24 (1992) 285-297.
8. C.G. Gonzaga, Path following methods for linear programming, SIAM Review 34 (2) (1992) 167-227.
9. H. Hafsteinsson, R. Levkovitz, G. Mitra, Solving large scale linear programming problems using an interior point method on a massively parallel SIMD computer, Journal of Parallel Algorithms and Applications 4 (3&4) (1994) 301-316.
10. J.K. Hurd, F.H. Murphy, Exploiting special structure in primal dual interior point methods, ORSA Journal on Computing 4 (1) (1992) 38-44.
11. I.J. Lustig, R.E. Marsten, D.F. Shanno, Computational experience with a primal-dual interior point method for Linear Programming, Linear Algebra and its Applications 152 (1991) 191-222.
12. I.J. Lustig, R.E. Marsten, D.F. Shanno, on implementing Mehrotra's predictor-corrector interior point method for Linear Programming, SIAM Journal on Optimization 2 (1992) 435-449.
13. I.J. Lustig, R.E. Marsten, D.F. Shanno, Interior point methods for linear programming: computational state of the art, ORSA Journal on Computing 6 (1) (1994) 1-14.
14. I. Maros, G. Mitra, Simplex algorithms, in: J. Beasley (Ed.), Recent Advances in Linear and Integer Programming, Oxford University Press, Oxford, UK, 1996, pp. 1-46.
15. R.E. Marsten, M.J. Saltzman, D.F. Shanno, J.F. Ballantijn, G.S. Pierce, Implementation of a dual affine interior point algorithm for Linear Programming, ORSA Journal on Computing 1 (1989) 287-297.
16. S. Mehrotra, Handling free variables in interior methods, Technical Report 91-06R1, Department of Industrial Engineering and Management Sciences, Northwestern University, Evaston, March 1991.
17. Cs. Mészáros, Fast Cholesky factorization for interior point methods of linear programming, LORDS WP 94-5, MTA SZTAKI, Budapest, 1994.
18. G. Mitra, R. Levkovitz, Solution of large linear programs: a review of hardware, software and algorithmic issues, in: T. Ciriani, R. Leachman (Eds.), Optimization in Industrial Environments, Wiley, New York, 1993, pp. 139-171.
19. M.A. Saunders, Major Cholesky would feel proud, ORSA Journal on Computing 6 (1) (1994) 23-27.
20. G.W. Stewart, Modifying pivot elements in Gaussian elimination, Mathematics of Computation 28 (1974) 537.
21. M.J. Todd, Exploiting special structure in Karmarkar's linear programming algorithm, Mathematical Programming 41 (1988) 81-103.
22. K. Turner, Computing projections for the Karmarkar algorithm, Linear Algebra and its Applications 152 (1991) 141-154.
23. R.J. Vanderbei, ALPO: Another Linear Program Optimizer, ORSA Journal on Computing 3 (2) (1993) 134-146.
24. R.J. Vanderbei, M.S. Meketon, B.F. Freedman, A modification of Karmarkar's linear programming algorithm, Algorithmica 1 (1986) 395-407.
25. R.J. Vanderbei, T.J. Carpenter, Symmetric indefinite systems for interior point methods, Mathematical Programming 58 (1993) 1-32.
26. R.J. Vanderbei, Interior-point methods: algorithms and formulations, ORSA Journal on Computing 6 (1) (1994) 32-34.
27. R.J. Vanderbei, Affine scaling for linear programs with free variables, Mathematical Programming 43 (1989) 31-44.