arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.11560math.OCmath.DS
收藏

一种用于长时域非线性动态规划的快速时间分解方法

A Fast Temporal Decomposition Procedure for Long-horizon Nonlinear Dynamic Programming

Sen Na, Mihai Anitescu, Mladen Kolar

AI总结:

本文提出一种基于SQP和重叠时间分解的快速方法,用于求解长时域非线性动态规划,仅需单步牛顿更新即可实现与Schwarz格式匹配的局部线性收敛速率。

摘要:

我们提出了一种用于求解长时域非线性动态规划的快速时间分解方法。该方法的核心是序列二次规划(SQP),并利用可微的精确增广拉格朗日函数作为评价函数。在每个SQP迭代中,我们采用重叠时间分解策略近似求解牛顿系统。我们证明,只要适当选择重叠大小和惩罚参数,近似搜索方向仍然是增广拉格朗日函数的下降方向,从而能够建立全局收敛性。此外,我们证明对于该近似搜索方向,单位步长在局部被接受,并进一步建立了在各阶段上一致的局部线性收敛性。该局部收敛速率与Na等人2022年提出的近期Schwarz格式的速率相匹配。然而,Schwarz格式在每次迭代中必须将非线性子问题求解到最优,而我们只需执行一步牛顿步。数值实验验证了我们的理论,并证明了我们方法的优越性。

英文摘要:

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian, provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit stepsize is accepted locally for the approximate search direction, and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme by Na et al., 2022. However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, while we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑