Metraipolis › archive › dc_e96d0ced2c14
Policy Iteration over Terminal Cost Functions: From LQR to MPC — arXiv:2611.03401
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03401
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:45:44.750Z
- SHA-256 of the archived text
e169c457f4714b6406fe52c6b4c409d9b6e0be2f789b4dbcf58f05b7c9836001- Stable URL of this page
https://metraipolis.com/documento/dc_e96d0ced2c14
How to cite
Policy Iteration over Terminal Cost Functions: From LQR to MPC — arXiv:2611.03401 — arXiv (en), https://arxiv.org/abs/2611.03401 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e96d0ced2c14 (Metraipolis archive dc_e96d0ced2c14, sha256 e169c457f4714b6406fe52c6b4c409d9b6e0be2f789b4dbcf58f05b7c9836001)
BibTeX
@misc{dce96d0ced2c14,
title = {Policy Iteration over Terminal Cost Functions: From LQR to MPC — arXiv:2611.03401},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03401},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e96d0ced2c14; sha256 e169c457f4714b6406fe52c6b4c409d9b6e0be2f789b4dbcf58f05b7c9836001},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03401. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Policy iteration is a classical method for successively improving control policies in optimal control and reinforcement learning. In this paper, we propose a policy iteration framework that refines receding-horizon control (RHC) and model predictive control (MPC) policies online by iteratively updating the terminal cost. We first develop the framework for the linear quadratic regulator (LQR) problem. We show that the Riccati map is a contraction in the Thompson metric on an explicitly constructed invariant order interval. Using this property, we prove convergence of approximate policy iteration for finite-horizon RHC, where the terminal cost is given by an approximate value function. From an initial terminal cost, we then construct a robust invariant order interval within which the RHC policy is refined online. We extend the analysis to constrained MPC and present a constructive algorithm for safely updating the terminal ingredients, which guarantees recursive feasibility and asymptotic stability of the closed loop throughout the iterations. These results connect classical Riccati theory with approximate policy iteration and provide a principled pathway toward learning MPC terminal ingredients. A numerical example illustrates the proposed method. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.03401 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:14:37.796Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).