Implementing an interior point method for linear programs on a CPU-GPU system

zbMATH Open1177.90288MaRDI QIDQ836722FDOQ836722

Authors: Jin Hyuk Jung, Dianne P. O'Leary 

Publication date: 8 September 2009

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117656

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Efficient GPU-based implementations of simplex type algorithms
• A factored sparse approximate inverse preconditioned conjugate gradient solver on graphics processing units
• GPU computing with Kaczmarz's and other iterative algorithms for linear systems
• An error correction solver for linear systems: evaluation of mixed precision implementations
• A new era in scientific computing: domain decomposition methods in hybrid CPU-GPU architectures

zbMATH Keywords

Cholesky factorizationmatrix decompositionforward and back substitutionrectangular packed format

Mathematics Subject Classification ID

Linear programming (90C05) Factorization of matrices (15A23) Interior-point methods (90C51) Parallel algorithms in computer science (68W10)

Cited In (6)

• Globally scheduled real-time multiprocessor systems with GPUs
• Efficient batch LU and QR decomposition on GPU
• A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
• Efficient GPU-based implementations of simplex type algorithms
• An error correction solver for linear systems: evaluation of mixed precision implementations
• GPU implementation of neural networks

Uses Software

• LIPSOL
• reducedLP
• GPGPU
• Cg

This page was built for publication: Implementing an interior point method for linear programs on a CPU-GPU system

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