加载中…
This paper presents a GPU-accelerated implementation of the SPOCK algorithm, a proximal method designed for solving scenario-based risk-averse optimal control problems. The proposed implementation leverages the massive parallelization of the SPOCK algorithm, and benchmarking against state-of-the-art interior-point solvers demonstrates GPU-accelerated SPOCK’s competitive execution time and memory footprint for large-scale problems. We further investigate the effect of the scenario tree structure on parallelizability, and so on solve time.

生成讲解博客的中文版本

生成AI智能校验的中文版本