Metraipolis › archive › dc_4b85a7fe2117

Accelerating Branch MPC with Two-Level Parallel Direct Solves on GPUs — arXiv:2609.29977

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29977
License (as archived)
CC0-1.0
Archived
2026-10-08T06:07:22.367Z
SHA-256 of the archived text
457f89072f11e6d089ffabf6477a080fa69d88fce7abd65fa34b5504a2d055b7
Stable URL of this page
https://metraipolis.com/documento/dc_4b85a7fe2117

How to cite

Accelerating Branch MPC with Two-Level Parallel Direct Solves on GPUs — arXiv:2609.29977 — arXiv (en), https://arxiv.org/abs/2609.29977 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4b85a7fe2117 (Metraipolis archive dc_4b85a7fe2117, sha256 457f89072f11e6d089ffabf6477a080fa69d88fce7abd65fa34b5504a2d055b7)
BibTeX
@misc{dc4b85a7fe2117,
  title = {Accelerating Branch MPC with Two-Level Parallel Direct Solves on GPUs — arXiv:2609.29977},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29977},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4b85a7fe2117; sha256 457f89072f11e6d089ffabf6477a080fa69d88fce7abd65fa34b5504a2d055b7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29977. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Branch model predictive control optimizes multiple future trajectories coupled through shared decisions, with computational demands increasing as the number of scenarios and prediction horizon grow. We present a GPU-accelerated direct linear solver for branch MPC formulations in which all trajectories share a single root decision node and evolve independently thereafter. By operating at the linear-algebra level, the solver provides a reusable backend for multiple optimization algorithms whose reduced systems have the required symmetric positive-definite structure. The solver exploits two levels of parallelism: across scenarios and along each prediction horizon. A tailored variable ordering enables horizon-parallel Cholesky factorization while preserving a single root-tail coupling block per scenario in the factor. Numerical experiments demonstrate substantial speedups over state-of-the-art sparse direct solvers, achieving factorization speedups of up to 6.0$\times$ over cuDSS and 27.6$\times$ over eight-thread PARDISO, with triangular solve speedups of up to 3.5$\times$ and 15.8$\times$, respectively.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.OC).
Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.29977 — 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-08T05:31:31.190Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).