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

非交换离散后优化算法用于椭圆型PDE约束最优控制问题

Non-commutative Discretize-then-Optimize Algorithms for Elliptic PDE-Constrained Optimal Control Problems

Southern Illinois University Edwardsville(南伊利诺伊大学爱德华兹维尔分校);University of South Carolina(南卡罗来纳大学)

Jun Liu, Zhu Wang

AI总结:

本文分析了基于二阶或四阶有限差分离散化的离散后优化算法收敛性,通过添加H₁半范数惩罚项恢复因非交换性导致的收敛性损失。

摘要:

本文分析了基于二阶或四阶有限差分离散化的离散后优化算法的收敛性,用于求解椭圆型PDE约束优化或最优控制问题。为确保离散后优化算法的收敛性,一种公认的标准是选择或重新设计离散化方案,使得所得离散后优化算法与对应的优化后离散化算法相容。换句话说,两种算法都会产生相同的离散最优系统。然而,这种方法并不简单。在本文中,通过研究一个简单的分布式椭圆最优控制问题,我们首先表明强制这种严格的相容性条件只是充分但不必要条件。随后,我们提出添加一些合适的H₁半范数惩罚/正则化项来恢复因相容性丢失导致的收敛性损失。数值实验用于验证我们的理论分析,并验证所提出正则化技术的有效性。

英文摘要:

In this paper, we analyze the convergence of several discretize-then-optimize algorithms, based on either a second-order or a fourth-order finite difference discretization, for solving elliptic PDE-constrained optimization or optimal control problems. To ensure the convergence of a discretize-then-optimize algorithm, one well-accepted criterion is to choose or redesign the discretization scheme such that the resultant discretize-then-optimize algorithm commutes with the corresponding optimize-then-discretize algorithm. In other words, both types of algorithms would give rise to exactly the same discrete optimality system. However, such an approach is not trivial. In this work, by investigating a simple distributed elliptic optimal control problem, we first show that enforcing such a stringent condition of commutative property is only sufficient but not necessary for achieving the desired convergence. We then propose to add some suitable $H_1$ semi-norm penalty/regularization terms to recover the lost convergence due to the inconsistency caused by the loss of commutativity. Numerical experiments are carried out to verify our theoretical analysis and also validate the effectiveness of our proposed regularization techniques.

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

↑