pith. sign in

arxiv: 1506.06494 · v1 · pith:O54TFCF7new · submitted 2015-06-22 · 🧮 math.OC · math.AP

Robust preconditioners for PDE-constrained optimization with limited observations

classification 🧮 math.OC math.AP
keywords optimizationpde-constrainedproblemspreconditionersrobustavailabledatadomain
0
0 comments X
read the original abstract

Regularization robust preconditioners for PDE-constrained optimization problems have been successfully developed. These methods, however, typically assume that observation data is available throughout the entire domain of the state equation. For many inverse problems, this is an unrealistic assumption. In this paper we propose and analyze preconditioners for PDE-constrained optimization problems with limited observation data, e.g. observations are only available at the boundary of the solution domain. Our methods are robust with respect to both the regularization parameter and the mesh size. That is, the condition number of the preconditioned optimality system is uniformly bounded, independently of the size of these two parameters. We first consider a prototypical elliptic control problem and thereafter more general PDE-constrained optimization problems. Our theoretical findings are illuminated by several numerical results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.