Krylov subspace acceleration for first-order splitting methods in convex quadratic programming

Preprint

We propose an acceleration scheme for first-order methods (FOMs) for convex quadratic programs (QPs) that is analogous to Anderson acceleration and the Generalized Minimal Residual algorithm for linear systems. We motivate our proposed method from the observation that FOMs applied to QPs typically consist of piecewise-affine operators. We describe our Krylov subspace acceleration scheme, contrasting it with existing Anderson acceleration schemes and showing that it largely avoids the latter's well-known ill-conditioning issues in regions of slow convergence. We demonstrate the performance of our scheme relative to Anderson acceleration using standard collections of problems from model predictive control and statistical learning applications. We show that our method is faster than Anderson acceleration across the board in terms of iteration count, and in many cases in computation time, particularly for optimal control and for problems solved to high accuracy.

Authors: Pereira, G; Goulart, PJ

• Publication status: Published
• Peer review status: Not peer reviewed
• Preprint server: arXiv
• Publication date: 2025-11-09
• DOI: 10.48550/arXiv.2511.06323
• EISSN: 2331-8422
• Language: English