Implementing cholesky factorization for interior point methods of linear programming
Data up to Jan 2025
Total Citations Per Year
Abstract
References (28)
Matrix computations
1983 • 31,414 citations
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
1982 • 4,151 citations
Computer Solution of Large Sparse Positive Definite Systems.
1982 • 1,918 citations
Direct Methods for Sparse Matrices
2017 • 1,634 citations
Direct solutions of sparse network equations by optimally ordered triangular factorization
1967 • 806 citations
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems
1982 • 760 citations
Direct Methods for Sparse Matrices.
1989 • 621 citations
The Elimination form of the Inverse and its Application to Linear Programming
1957 • 513 citations
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
1986 • 439 citations
An implementation of Karmarkar's algorithm for linear programming
1989 • 424 citations
The Evolution of the Minimum Degree Ordering Algorithm
1989 • 384 citations
Yale sparse matrix package I: The symmetric codes
1982 • 304 citations
Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
1980 • 140 citations
MA27 -- A set of Fortran subroutines for solving sparse symmetric sets of linear equations
1982 • 131 citations
On the augmented system approach to sparse least-squares problems
1989 • 115 citations
Computational results of an interior point algorithm for large scale linear programming
1991 • 81 citations
Sparse Matrix Methods in Optimization
1984 • 71 citations
Further Development of a Primal-Dual Interior Point Method
1990 • 67 citations
Chapter II Linear programming
1989 • 41 citations
Generalized conjugate directions
1987 • 40 citations
Vector processing in simplex and interior methods for linear programming
1990 • 33 citations
Computing Karmarkar projections quickly
1988 • 32 citations
IMACS '91: Proceedings of the IMACS World Congress on Computation and Applied Mathematics (13th) Held in Dublin, Ireland on July 22-26, 1991. Volume 2. Computational Fluid Dynamics and Wave Propagation, Parallel Computing, Concurrent and Supercomputing, Computational Physics/Computational Chemistry and Evolutionary Systems
1991 • 25 citations
Splitting dense columns of constraint matrix in interior point methods for large scale linear programming11The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:22A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…
1992 • 15 citations
HOPDM — A higher order primal-dual method for large scale linear programming
1993 • 12 citations
Detection of near-singularity in Cholesky and LDLT factorizations
1987 • 3 citations
A comparison of three algorithms for reducing the profile of a sparse matrix
1989 • 2 citations
The design and application of IPMLO. A FORTRAN library for linear optimization with interior point methods
1994 • 1 citations