Improving the accuracy of linear programming solvers with iterative refinement

DOI10.1145/2442829.2442858zbMath1308.65091OpenAlexW2163882763MaRDI QIDQ5244534

Kati Wolter, Daniel E. Steffy, Ambros M. Gleixner

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442858

zbMATH Keywords

optimizationlinear programmingiterative refinement

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (7)

Selfadhesivity in Gaussian conditional independence structures ⋮ Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry ⋮ Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations ⋮ Proximity measures based on KKT points for constrained multi-objective optimization ⋮ Solving quadratic programs to high precision using scaled iterative refinement ⋮ Iterative Refinement for Linear Programming ⋮ Towards an Accurate Solution of Wireless Network Design Problems

Uses Software

• gmp
• SoPlex
• MIPLIB
• Benchmarks for Optimization Software
• QSopt_ex
• NETLIB LP Test Set

This page was built for publication: Improving the accuracy of linear programming solvers with iterative refinement