返回
OPTIMAL SOLVERS FOR PDE-CONSTRAINED OPTIMIZATION
DOI:10.1137/080727154.png)
摘要
En 中文
Optimization problems with constraints which require the solution of a partial differential equation arise widely in many areas of the sciences and engineering, particularly in problems of design. The solution of such PDE-constrained optimization problems is usually a major computational task. Here we consider simple problems of this type: distributed control problems in which the 2- and 3-dimensional Poisson problem is the PDE. The large-dimensional linear systems which result from discretization and which need to be solved are of saddle-point type. We introduce two optimal preconditioners for these systems, which lead to convergence of symmetric Krylov subspace iterative methods in a number of iterations which does not increase with the dimension of the discrete problem. These preconditioners are block structured and involve standard multigrid cycles. The optimality of the preconditioned iterative solver is proved theoretically and verified computationally in several test cases. The theoretical proof indicates that these approaches may have much broader applicability for other PDEs.
Keyword:
saddle-point problems
PDE-constrained optimization
preconditioning
optimal control
linear systems
all-at-once methods
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Balanced truncation model reduction for a class of descriptor systems with application to the Oseen equations一类描述符系统的平衡截断模型简化及其在Oseen方程中的应用
Neumann-Neumann domain decomposition preconditioners for linear-quadratic elliptic optimal control problems线性二次椭圆最优控制问题的neumann-neumann域分解预处理器

