IPM based sparse LP solver on a heterogeneous processor

DOI10.1007/s10287-012-0137-3zbMath1273.90118OpenAlexW2057320913MaRDI QIDQ373202

Lasse Natvig, Mujahed Eleyat

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

sparse Cholesky factorizationinterior point methodscell BE processorheterogeneous processorsupernode amalgamation

Mathematics Subject Classification ID

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

Uses Software

• GLPK

Cites Work

• Locality of reference in sparse Cholesky factorization methods
• On the Implementation of a Primal-Dual Interior Point Method
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• The influence of relaxed supernode partitions on the multifrontal method
• Efficient Methods for Out-of-Core Sparse Cholesky Factorization
• Unnamed Item

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