Implementing cholesky factorization for interior point methods of linear programming
- 1 January 1993
- journal article
- Published by Taylor & Francis in Optimization
- Vol. 27 (1-2), 121-140
- https://doi.org/10.1080/02331939308843876
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming 1 1The 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: 2 2A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-16, 1991$ef:Optimization, 1992
- Vector processing in simplex and interior methods for linear programmingAnnals of Operations Research, 1990
- On the augmented system approach to sparse least-squares problemsNumerische Mathematik, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- Chapter II Linear programmingPublished by Elsevier ,1989
- Generalized conjugate directionsLinear Algebra and its Applications, 1987
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- Sparse Matrix Methods in OptimizationSIAM Journal on Scientific and Statistical Computing, 1984
- Yale sparse matrix package I: The symmetric codesInternational Journal for Numerical Methods in Engineering, 1982