Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems

From MaRDI portal
Publication:6180307

DOI10.1002/OCA.3054arXiv2107.01745OpenAlexW3182053427MaRDI QIDQ6180307FDOQ6180307

A. Bemporad, Pantelis Sopasakis, Panagiotis Patrinos, Ajay Kumar Sampathirao

Publication date: 19 January 2024

Published in: Optimal Control Applications \& Methods (Search for Journal in Brave)

Abstract: Scenario-based stochastic optimal control problems suffer from the curse of dimensionality as they can easily grow to six and seven figure sizes. First-order methods are suitable as they can deal with such large-scale problems, but may fail to achieve accurate solutions within a reasonable number of iterations. To achieve solutions of higher accuracy and high speed, in this paper we propose two proximal quasi-Newtonian limited-memory algorithms - MinFBE applied to the dual problem and the Newton-type alternating minimization algorithm (NAMA) - which can be massively parallelized on lockstep hardware such as graphics processing units (GPUs). We demonstrate the performance of these methods, in terms of convergence speed and parallelizability, on large-scale problems involving millions of variables.


Full work available at URL: https://arxiv.org/abs/2107.01745







Cites Work






This page was built for publication: Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180307)