Approximate one-time preconditioning in face for MPGP algorithms yields error bounds, a sharp condition-number estimate, and large observed speedups on quadratic programs with constraints.
Posp´ ıˇ sil, ‘Development of algorithms for solving minimizing problems with convex quadratic function on special convex sets and applications,’ Available at http://hdl.handle
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Accelerating MPGP-type Methods Through Preconditioning
Approximate one-time preconditioning in face for MPGP algorithms yields error bounds, a sharp condition-number estimate, and large observed speedups on quadratic programs with constraints.