大规模随机最优控制问题的大规模并行近似算法
Massively parallelizable proximal algorithms for large-scale stochastic optimal control problems
摘要:
基于场景的随机最优控制问题的维数灾难,因为他们可以很容易地增长到六个和七个数字的大小。一阶方法是合适的,因为它们可以处理这样的大规模问题,但可能无法在合理的迭代次数内获得精确的解。为了实现更高的精度和速度的解决方案,在本文中,我们提出了两个近似的拟牛顿有限内存算法- MinFBE适用于对偶问题和牛顿型交替最小化算法(NAMA)-这可以大规模并行锁步硬件,如图形处理单元(GPU)。我们证明了这些方法的性能,在收敛速度和并行化,涉及数百万个变量的大规模问题。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。