The cholesky factorization in interior point methods

[1]  William Orchard-Hays,et al.  Advanced Linear-Programming Computing Techniques , 1968 .

[2]  C. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[3]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[4]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[5]  Gene H. Golub,et al.  Matrix computations , 1983 .

[6]  Kees Roos,et al.  Degeneracy in interior point methods for linear programming: a survey , 1993, Ann. Oper. Res..

[7]  Margaret H. Wright,et al.  Some properties of the Hessian of the logarithmic barrier function , 1994, Math. Program..

[8]  István Maros,et al.  A numerically exact implementation of the simplex method , 1995, Ann. Oper. Res..

[9]  E. Andersen.  Finding all linearly dependent rows in large-scale linear programming , 1995 .

[10]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

[11]  C. Mészáros.  Fast Cholesky factorization for interior point methods of linear programming , 1996 .

[12]  J. L. Nazareth,et al.  Linear and nonlinear conjugate gradient-related methods , 1996 .

[13]  Stephen J. Wright.  Stability of Augmented System Factorizations in Interior-Point Methods , 1997, SIAM J. Matrix Anal. Appl..

[14]  Stephen J. Wright,et al.  PCx user guide , 1997 .

[15]  T Talaky,et al.  Interior Point Methods of Mathematical Programming , 1997 .

[16]  C. Mészáros.  On free variables in interior point methods , 1998 .

[17]  Stephen J. Wright.  Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming , 1999, SIAM J. Optim..

[18]  Stephen J. Wright.  Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming , 2001, SIAM J. Optim..