A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
From MaRDI portal
Publication:4983284
DOI10.1080/00207160.2014.890716zbMath1308.65096OpenAlexW2081395372MaRDI QIDQ4983284
Nikolaos Ploskas, Nikolaos Samaras
Publication date: 25 March 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.890716
Numerical mathematical programming methods (65K05) Linear programming (90C05) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (3)
Efficient GPU-based implementations of simplex type algorithms ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm
Uses Software
Cites Work
- Unnamed Item
- Scaling linear optimization problems prior to application of the simplex method
- On scaling linear programs—some experimental results
- An Algorithm for Scaling Matrices
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- On the Automatic Scaling of Matrices for Gaussian Elimination
This page was built for publication: A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit