.png){kind=icon}
返回
An SQP-based multiple shooting algorithm for large-scale PDE-constrained optimal control problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2023.111927.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multiple shooting methods for solving optimal control problems have been developed rapidly in the past decades and are widely considered a promising direction to speed up the optimization process. Here we propose and analyze a new multiple shooting algorithm based on a sequential quadratic programming (SQP) method that is suitable for optimal control problems governed by large-scale time-dependent partial-differential equations (PDEs). We investigate the structure of the KKT matrix and solve the large-scale KKT system by a preconditioned conjugate gradient algorithm. A simplified block Schur complement preconditioner is proposed, that allows for the parallelization of the method in the time domain. The proposed algorithm is first validated for an optimal control problem constrained by the Nagumo equation. The results indicate that considerable accelerations can be achieved for multiple shooting approaches with appropriate starting guesses and scaling of the matching conditions. We further apply the proposed algorithm to a two-dimensional velocity tracking problem governed by the Navier-Stokes equations. We find algorithmic speed-ups of up to 12 versus single shooting on up to 50 shooting windows. We also compare results with earlier work that uses an augmented Lagrangian algorithm instead of SQP, showing better performance of the SQP method for most of the cases.(c) 2023 Elsevier Inc. All rights reserved.
Keyword:
Multiple shooting
Sequential quadratic programming
PDE-constrained optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容