The Cholesky factorization in interior point methods

Computers and Mathematics with Applications

Volumn 50, Issue 7, 2005, Pages 1157-1166

  Meszaros C ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Cholesky factorization; Interior point methods; Linear programming

Indexed keywords

CHOLESKY FACTORIZATIONS; INTERIOR POINT METHODS;

DIGITAL ARITHMETIC; ITERATIVE METHODS; LINEAR PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

MATRIX ALGEBRA;

EID: 26444592252     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2005.08.016     Document Type: Conference Paper

References (20)

1. M.H. Wright Some properties of the Hessian of the logarithmic barrier function Math. Programming 67 1994 265 295
2. S.J. Wright Modified Cholesky factorizations in interior-point algorithms for linear programming SIAM Journal on Optimization 9 4 1999 1159 1191
3. S.J. Wright Stability of linear algebra computations in interior-point methods for linear programming SIAM J. Matrix Analysis and Applications 18 1997 191 222
4. S.J. Wright Effects of finite-precision arithmetic on interior-point methods for nonlinear programming SIAM Journal on Optimization 12 1 2001 36 78
5. O. Güler, D. den Hertog, C. Roos, T. Terlaky, and T. Tsuchiya Degeneracy in interior point algorithms for linear programming: A survey Annals of Operations Research 46 1993 107 138
6. E.D. Andersen, J. Gondzio, Cs. Mészáxos, and X. Xu Implementation of interior point methods for large scale linear programs T. Terlaky Interior Point Methods of Mathematical Programming 1996 Kluwer Academic 189 252
7. M.A. Saunders Cholesky-based methods for sparse least squares: The benefits of regularization L. Adams J.L. Nazareth Linear and Nonlinear Conjugate Gradient-Related Methods 1996 SIAM 92 100
8. R.J. Vanderbei LOQO user's manual, Technical Report SOR-96-07 1996 Princeton University, School of Engineering and Applied Science, Dept. of Civil Engineering and Op. Res.
9. November A. Gupta WSMP: Watson sparse matrix package Technical Report RC21888, IBM Research Report 2000 IBM T.J. Watson Research Center
10. Cs. Mészáros On free variables in interior point methods Optimization Methods and Software 9 1997 121 139
11. G.H. Golub, and C.F. Van Loan Matrix Computations Second Edition 1989 The John Hopkins University Press
12. C.L. Lawson, and R.J. Hanson Solving Least Squares Problems 1974 Prentice-Hall Baltimore
13. W. Orchard-Hays Advanced Linear Programming Computing Techniques 1968 McGraw-Hill
14. I. Maros, and Cs. Mészáros A numerically exact implementation of the simplex method Annals of Operations Research 58 1995 3 17
15. Cs. Méészáros The efficient implementation of interior point methods for linear programming and their applications Ph.D. Thesis 1996 Eötvös Loránd University of Sciences
16. J. Czyzyk, S. Mehrotra, and S.J. Wright PCx user guide, Technical Report OTC 96/01 1996 Optimization Technology Center, Argonne National Laboratory and Northwestern University
17. Cs. Mészáros Fast Cholesky factorization for interior point methods of linear programming Computers Math. Applic. 31 4/5 1996 49 54
18. A. George, and J.W.H. Liu Computer Solution of Large Sparse Positive Definite Systems 1981 Prentice-Hall
19. D.M. Gay Electronic mail distribution of linear programming test problems COAL Newsletter 13 1985 10 12
20. E.D. Andersen Finding all linearly dependent rows in large-scale linear programming Optimization Methods and Software 6 1995 219 227