Sparsity regularization for parameter identification problems

Abstract

The investigation of regularization schemes with sparsity promoting penalty terms has been one of the dominant topics in the field of inverse problems over the last years, and Tikhonov functionals with p -penalty terms for 1 p 2 have been studied extensively. The first investigations focused on regularization properties of the minimizers of such functionals with linear operators and on iteration schemes for approximating the minimizers. These results were quickly transferred to nonlinear operator equations, including nonsmooth operators and more general function space settings. The latest results on regularization properties additionally assume a sparse representation of the true solution as well as generalized source conditions, which yield some surprising and optimal convergence rates. The regularization theory with p sparsity constraints is relatively complete in this setting; see the first part of this review. In contrast, the development of efficient numerical schemes for approximating minimizers of Tikhonov functionals with sparsity constraints for nonlinear operators is still ongoing. The basic iterated soft shrinkage approach has been extended in several directions and semi-smooth Newton methods are becoming applicable in this field. In particular, the extension to more general non-convex, non-differentiable functionals by variational principles leads to a variety of generalized iteration schemes. We focus on such iteration schemes in the second part of this review. A major part of this survey is devoted to applying sparsity constrained regularization techniques to parameter identification problems for partial differential equations, which we regard as the prototypical setting for nonlinear inverse problems. Parameter identification problems exhibit different levels of complexity and we aim at characterizing a hierarchy of such problems. The operator defining these inverse problems is the parameter-to-state mapping. We first summarize some general analytic properties derived from the weak formulation of the underlying differential equation, and then analyze several concrete parameter identification problems in detail. Naturally, it is not possible

An inverse problem for a one-dimensional time-fractional diffusion problem

“…However, we shall not delve into the extremely important question of practical reconstructions, since it relies heavily on a priori knowledge on the sought for solution and the statistical nature (Gaussian, Poisson, Laplace ...) of the contaminating noise in the data, which will depend very much on the specific application. We refer interested readers to the monographs [26,92,41] and the survey [49] for updated accounts on regularization methods for constructing stable reconstructing procedures and efficient computational techniques. We will also briefly mention below related works on the application of regularization techniques to inverse problems for FDEs.…”

A Kaczmarz Version of the REGINN-Landweber Iteration for Ill-Posed Problems in Banach Spaces

“…Thus, (12) x n+1 = x n + s n,kn = z n,kn = J * p * (J p (x n ) + u n,kn ) where the final (inner) index k n is determined as follows: choose k max ∈ N and µ ∈ ]0, 1[, set (13) k REG := min {k ∈ {1, . .…”

“…For an overview, examples, and references we point to the monograph [25], to the special section Tackling inverse problems in a Banach space environment (Inverse Problems, 28(10), 2012) and to the topical review article [13].…”

Atmospheric inverse modeling via sparse reconstruction

“…While the classical approach tends to smooth the true process (in any representation system), sparse reconstruction is designed to find such localized structures. Jin and Maass (2012) give a detailed summary of the mathematical advances with the sparsity constraint.…”