Solving quadratic programs to high precision using scaled iterative refinement
From MaRDI portal
Publication:2293654
DOI10.1007/s12532-019-00154-6zbMath1434.90119arXiv1803.07178OpenAlexW2792890110WikidataQ128437097 ScholiaQ128437097MaRDI QIDQ2293654
Ambros M. Gleixner, Tobias Weber, Sebastian Sager
Publication date: 5 February 2020
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.07178
Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Uses Software
Cites Work
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Optimal quadratic programming algorithms. With applications to variational inequalities
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- Iterative Refinement for Linear Programming
- The Simplex Method for Quadratic Programming
- A repository of convex quadratic programming problems
- Inexact Newton-Type Optimization with Iterated Sensitivities
- Improving the accuracy of linear programming solvers with iterative refinement
- An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
- An efficient, exact, and generic quadratic programming solver for geometric optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving quadratic programs to high precision using scaled iterative refinement