arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.07008math.OC
收藏

具有组合切换约束的抛物型最优控制问题——第二部分:外部近似算法

Parabolic optimal control problems with combinatorial switching constraints -- Part II: Outer approximation algorithm

Christoph Buchheim, Alexandra Grütering, Christian Meyer

AI总结:

本文针对带组合切换约束的抛物型最优控制问题,基于可行切换模式凸包的外部描述构造函数空间中的外部近似算法,证明其强收敛到全局极小值,并用半光滑牛顿法求解子问题,通过二维数值算例验证算法效率。

摘要:

我们考虑偏微分方程的最优控制问题,其中控制量取二值但在时间范围内变化,因此可将其视为动态开关。切换模式可能受到组合约束,例如对切换总次数的上界限制或对两次切换之间时间间隔的下界限制。在配套论文[arXiv:2203.07121]中,我们将可行切换模式凸包的$L^p$-闭包描述为由有限维投影导出的凸集的交集。在本文中,所得到的外部描述被用于在函数空间中构造外部近似算法,其迭代被证明在$L^2$中强收敛到凸化最优控制问题的全局极小值。外部近似算法每次迭代中产生的线性二次子问题通过半光滑牛顿法求解。一个二维空间中的数值算例说明了整体算法的效率。

英文摘要:

We consider optimal control problems for partial differential equations where the controls take binary values but vary over the time horizon, they can thus be seen as dynamic switches. The switching patterns may be subject to combinatorial constraints such as, e.g., an upper bound on the total number of switchings or a lower bound on the time between two switchings. In a companion paper [arXiv:2203.07121], we describe the $L^p$-closure of the convex hull of feasible switching patterns as intersection of convex sets derived from finite-dimensional projections. In this paper, the resulting outer description is used for the construction of an outer approximation algorithm in function space, whose iterates are proven to converge strongly in $L^2$ to the global minimizer of the convexified optimal control problem. The linear-quadratic subproblems arising in each iteration of the outer approximation algorithm are solved by means of a semi-smooth Newton method. A numerical example in two spatial dimensions illustrates the efficiency of the overall algorithm.

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

↑