




























Abstract:Quadratic programming is a workhorse of modern nonlinear optimization, control, and data science. Although regularized methods offer convergence guarantees under minimal assumptions on the problem data, they can exhibit the slow tail-convergence typical of first-order schemes, thus requiring many iterations to achieve high-accuracy solutions. Moreover, hyperparameter tuning significantly impacts the solver performance but how to find an appropriate parameter configuration remains an elusive research question. To address these issues, we explore how data-driven approaches can accelerate the solution process. Aiming at high-accuracy solutions, we focus on a regularized interior-point solver and carefully handle its two-loop flow and control parameters. We will show that reinforcement learning can make a significant contribution to facilitating the solver tuning and to speeding up the optimization process. Numerical experiments demonstrate that, after a lightweight training, the learned policy generalizes well to different problem classes with varying dimensions.
| Comments: | 20 pages, 9 figures, 4 tables |
| Subjects: | Optimization and Control (math.OC); Machine Learning (cs.LG) |
| Cite as: | arXiv:2509.07404 [math.OC] |
| (or arXiv:2509.07404v2 [math.OC] for this version) | |
| https://doi.org/10.48550/arXiv.2509.07404 arXiv-issued DOI via DataCite |
From: Alberto De Marchi [view email]
[v1]
Tue, 9 Sep 2025 05:33:45 UTC (1,817 KB)
[v2]
Fri, 15 May 2026 14:35:47 UTC (8,461 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。