IPM based sparse LP solver on a heterogeneous processor

DOI10.1007/S10287-012-0137-3MaRDI QIDQ373202zbMATH OpenOpenAlexFDO

Authors Mujahed Eleyat, Lasse Natvig

Publication date 21 October 2013

Published in Computational Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10287-012-0137-3

zbMATH Keywords

cell BE processorheterogeneous processorinterior point methodssparse Cholesky factorizationsupernode amalgamation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• An implementation of a parallel primal-dual interior point method for block- structured linear programs
• scientific article; zbMATH DE number 432998
• Numerical Factorization Methods for Interior Point Algorithms
• scientific article; zbMATH DE number 434541
• Fast Cholesky factorization for interior point methods of linear programming

Cites work

• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• Efficient Methods for Out-of-Core Sparse Cholesky Factorization
• scientific article; zbMATH DE number 2005717 (Why is no real title available?)
• Locality of reference in sparse Cholesky factorization methods
• On the Implementation of a Primal-Dual Interior Point Method
• The influence of relaxed supernode partitions on the multifrontal method

Describes a project that uses

Uses Software

• GLPK

This page was built for publication: IPM based sparse LP solver on a heterogeneous processor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q373202)