Functional error estimators for the adaptive discretization of inverse problems

Abstract

So-called functional error estimators provide a valuable tool for reliably estimating the discretization error for a sum of two convex functions. We apply this concept to Tikhonov regularization for the solution of inverse problems for partial differential equations, not only for quadratic Hilbert space regularization terms but also for nonsmooth Banach space penalties. Examples include the measure-space norm (i.e., sparsity regularization) or the indicator function of an $L^{\infty }$ ball (i.e., Ivanov regularization). The error estimators can be written in terms of residuals in the optimality system that can then be estimated by conventional techniques, thus leading to explicit estimators. This is illustrated by means of an elliptic inverse source problem with the above-mentioned penalties, and numerical results are provided for the case of sparsity regularization.

References in corpus (2)

• Necessary conditions for variational regularization schemes
• Grisvard's shift theorem near L^infinity and Yudovich theory on polygonal domains

Cited by in corpus (7)

• Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
• Adaptive Reconstruction for Electrical Impedance Tomography with a Piecewise Constant Conductivity
• Bi-level iterative regularization for inverse problems in nonlinear PDEs
• Sequential bi-level regularized inversion with application to hidden reaction law discovery
• Error Estimates for Arnoldo-Tikhonov Regularization for Ill-Posed Operator Equations
• Adaptive Approximations of Inclusions in a Semilinear Elliptic Problem Related to Cardiac Electrophysiology
• The Ivanov regularized Gauss-Newton method in Banach space with an a posteriori choice of the regularization radius