On numerical issues of interior point methods

SIAM Journal on Matrix Analysis and Applications

Volumn 30, Issue 1, 2008, Pages 223-235

  Mészáros, Csaba ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Indefinite Cholesky factorization; Interior point methods; Regularization

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; LARGE SCALE SYSTEMS; LINEARIZATION;

ADAPTIVE TECHNIQUES; AUGMENTED SYSTEMS; CONVERGENCE PROPERTIES; FUNDAMENTAL PROPERTIES; INDEFINITE CHOLESKY FACTORIZATION; INTERIOR POINT METHODS; ITERATIVE REFINEMENTS; LINEAR PROGRAMMING PROBLEMS; NUMERICAL EXPERIMENTS; NUMERICAL STABILITIES; REGULARIZATION; REGULARIZATION TECHNIQUES; RELAXATION TECHNIQUES;

FACTORIZATION;

EID: 61849122332     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050633354     Document Type: Article

References (27)

1. E. D. ANDERSEN, J. GONDZIO, C. MÉSZÁ ROS, AND X. XU, Implementation of interior point methods for large scale linear programs, in Interior Point Methods of Mathematical Programming, T. Terlaky, ed., Appl. Math. Optim. 33, Kluwer Acad. Publ., 1996, pp. 189-252.
2. M. ARIOLI, I. S. DUFF, AND P. P. M. DE RIJK, On the augmented system approach to sparse least-squares problems, Numer. Math., 55 (1989), pp. 667-684.
3. A. BJORK, Iterative refinement of linear least squares solutions, BIT, 8 (1967), pp. 8-30.
4. L. Fox, An Introduction To Numerical Linear Algebra, Clarendon Press, Oxford, 1964.
5. D. M. GAY, Electronic mail distribution of linear programming test problems, COAL Newsletter, 13 (1985), pp. 10-12.
6. P. E. GILL, M. A. SAUNDERS, AND J. R. SHINNERL, On the stability of Cholesky factorization for symmetric quasi-definite systems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 35-46.
7. J. GONDZIO AND T. TERLAKY, A computational view of interior point methods for linear programming, in Advances in Linear and Integer Programming, J. Beasley, ed., Oxford University Press, Oxford, 1995, pp. 103-144.
8. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Progress in Mathematical Programming: Interior-Point Algorithms and Related Methods, N. Megiddo, ed., Springer Verlag, New York, 1989, pp. 29-47.
9. I. J. LUSTIG, R. E. MARSTEN, AND D. F. SHANNO, Computational experience with a primaldual interior point method for linear programming, Linear Algebra Appl., 152 (1991), pp. 191-222.
10. I. MAROS AND C. MÉSZÁROS, The role of the augmented system in interior point methods, Eur. J. Oper. Res., 107 (1998), pp. 720-736.
11. I. MAROS AND C. MÉSZÁROS, A repository of convex quadratic programming problems, Optim. Methods Softw., 11/12 (1999), pp. 671-681. The test problems are available online from ftp://ftp.sztaki.hu/pub/oplab/QPDATA.
12. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior-Point Algorithms and Related Methods, N. Megiddo, ed., Springer Verlag, New York, 1989, pp. 131-158.
13. S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
14. S. MEHROTRA AND Y. YE, Finding an interior point in the optimal face of linear programs, Math. Programming, 62 (1993), pp. 497-515.
15. C. MÉSZÁROS, On free variables in interior point methods, Optim. Methods Softw., 9 (1997), pp. 121-139.
16. C. MÉSZÁROS, The BPMPD interior-point solver for convex quadratic problems, Optim. Methods Softw., 11/12 (1999), pp. 431-449.
17. C. MÉSZÁROS, On the Cholesky factorization in interior point methods, Comput. Math. Appl., 50 (2005), pp. 1157-1166.
18. C. MÉSZÁROS AND U.H. SUHL, Advanced preprocessing techniques for linear and quadratic programming, OR Spectrum, 25 (2004), pp. 575-595.
19. C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and leastsquares problems, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
20. M. A. SAUNDERS, Major Cholesky would feel proud, ORSA J. Comput., 6 (1994), pp. 94-105.
21. M. A. SAUNDERS, Solution of sparse rectangular systems using LSQR and CRAIG, BIT, 35 (1995), pp. 588-604.
22. M. A. SAUNDERS, Cholesky-based methods for sparse least squares: The benefits of regularization, in Linear and Nonlinear Conjugate Gradient-Related Methods, L. Adams and J. L. Nazareth, eds., SIAM, 1996, pp. 92-100.
23. R. J. VANDERBEI, Symmetric quasi-definite matrices, SIAM J. Optim., 5 (1995), pp. 100-113.
24. M. H. WRIGHT, Some properties of the Hessian of the logarithmic barrier function, Math. Programming, 67 (1994), pp. 265-295.
25. S. J. WRIGHT, Primal-Dual Interior Point Methods, SIAM, Philadelphia, 1997.
26. S. J. WRIGHT, Stability of augmented system factorizations in interior-point methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 191-222.
27. S. J. WRIGHT, Modified Cholesky factorizations in interior-point algorithms for linear programming, SIAM J. Optim., 9 (1999), pp. 1159-1191.