Numerical Factorization Methods for Interior Point Algorithms
From MaRDI portal
Publication:4291503
DOI10.1287/IJOC.6.1.94zbMATH Open0798.90099OpenAlexW2050750473MaRDI QIDQ4291503FDOQ4291503
Authors: Ho-Won Jung, Roy E. Marsten, Matthew J. Saltzman 
Publication date: 10 May 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.6.1.94
Recommendations
loop unrollinginterior point algorithmsequivalent sparse matrix reorderingfactorization stepprimal-dual barrier algorithm
Cited In (12)
- On the implementation of interior point methods for dual-core platforms
- Dynamic factorization in large-scale optimization
- Title not available (Why is that?)
- Recovering an optimal LP basis from an interior point solution
- Implementing cholesky factorization for interior point methods of linear programming
- An Infinitely Summable Series Implementation of Interior Point Methods
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems
- Prior reduced fill-in in solving equations in interior point algorithms
- IPM based sparse LP solver on a heterogeneous processor
- On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors
- 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-…
- Title not available (Why is that?)
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)
