Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.07404 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917497792364544 |
|---|---|
| author | Bertoncini, Jeremy De Marchi, Alberto Gerdts, Matthias Gottschalk, Simon |
| author_facet | Bertoncini, Jeremy De Marchi, Alberto Gerdts, Matthias Gottschalk, Simon |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_07404 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reinforcement learning for adaptive interior point methods in convex quadratic programming Bertoncini, Jeremy De Marchi, Alberto Gerdts, Matthias Gottschalk, Simon Optimization and Control Machine Learning 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. |
| title | Reinforcement learning for adaptive interior point methods in convex quadratic programming |
| topic | Optimization and Control Machine Learning |
| url | https://arxiv.org/abs/2509.07404 |