Necessary conditions for variational regularization schemes

Abstract

We study variational regularization methods in a general framework, more precisely those methods that use a discrepancy and a regularization functional. While several sets of sufficient conditions are known to obtain a regularization method, we start with an investigation of the converse question: How could necessary conditions for a variational method to provide a regularization method look like? To this end, we formalize the notion of a variational scheme and start with comparison of three different instances of variational methods. Then we focus on the data space model and investigate the role and interplay of the topological structure, the convergence notion and the discrepancy functional. Especially, we deduce necessary conditions for the discrepancy functional to fulfill usual continuity assumptions. The results are applied to discrepancy functionals given by Bregman distances and especially to the Kullback-Leibler divergence.

To appear in Inverse Problems

References in corpus (2)

• Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data
• Local Linear Convergence of Approximate Projections onto Regularized Sets

Cited by in corpus (6)

• Tikhonov regularization with oversmoothing penalty for non-linear ill-posed problems in Hilbert scales
• On the identification of the nonlinearity parameter in the Westervelt equation from boundary measurements
• Generalized modes in Bayesian inverse problems
• On convergence and convergence rates for Ivanov and Morozov regularization and application to some parameter identification problems in elliptic PDEs
• Functional error estimators for the adaptive discretization of inverse problems
• Quasi-solution of linear inverse problems in non-reflexive Banach spaces