Numerical Factorization Methods for Interior Point Algorithms
From MaRDI portal
Publication:4291503
Recommendations
Cited in
(12)- Dynamic factorization in large-scale optimization
- Implementing cholesky factorization for interior point methods of linear programming
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems
- Recovering an optimal LP basis from an interior point solution
- On the implementation of interior point methods for dual-core platforms
- Prior reduced fill-in in solving equations in interior point algorithms
- scientific article; zbMATH DE number 724214 (Why is no real title available?)
- IPM based sparse LP solver on a heterogeneous processor
- On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors
- An Infinitely Summable Series Implementation of Interior Point Methods
- scientific article; zbMATH DE number 1187129 (Why is no real title available?)
- 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-…
This page was built for publication: Numerical Factorization Methods for Interior Point Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291503)