Metraipolis › archive › dc_b599683ec205
Exploiting Micro-Structure in the Generalized Riccati Recursion for Optimal Control — arXiv:2608.29238
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29238
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:02:46.783Z
- SHA-256 of the archived text
13da5d7448187a7759880dd22dcf01693fdf43b37d1f26cda391347a649ff3c8- Stable URL of this page
https://metraipolis.com/documento/dc_b599683ec205
How to cite
Exploiting Micro-Structure in the Generalized Riccati Recursion for Optimal Control — arXiv:2608.29238 — arXiv (en), https://arxiv.org/abs/2608.29238 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b599683ec205 (Metraipolis archive dc_b599683ec205, sha256 13da5d7448187a7759880dd22dcf01693fdf43b37d1f26cda391347a649ff3c8)
BibTeX
@misc{dcb599683ec205,
title = {Exploiting Micro-Structure in the Generalized Riccati Recursion for Optimal Control — arXiv:2608.29238},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29238},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b599683ec205; sha256 13da5d7448187a7759880dd22dcf01693fdf43b37d1f26cda391347a649ff3c8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29238. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Optimal Control Problems (OCPs) have been applied to a variety of applications. Such problems are often transcribed into a Nonlinear Program (NLP) for which solution methods typically solve a Linear Quadratic (LQ) subproblem. To efficiently solve this LQ subproblem, the Riccati recursion exploits the block-diagonal structure that arises from discretizing an OCP using a Multiple Shooting method. However, reformulating general dynamics constraints to fit the required problem structure to use the Riccati recursion introduces additional micro-structure within these block matrices that remains unexploited. This work demonstrates how structure-exploiting solvers such as Fatrop can benefit from exploiting not only the block-diagonal structure but also the micro-structure within those blocks. We propose a structure-exploiting LU decomposition algorithm and integrate it within the Riccati recursion. Numerical results on randomized linear systems and two OCP examples demonstrate a reduction in computation time of the search direction of up to 20%, with the largest speedup observed for relative zero block sizes around 0.25 and large stage-wise equality constraint jacobians. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.29238 — 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-10-17T08:40:19.728Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).