Regularization in Banach spaces — convergence rates by approximative source conditions

Author(s):  
T. Hein
1993 ◽  
Vol 96 (2) ◽  
pp. 137-151
Author(s):  
Vidmantas Bentkus ◽  
Friedrich G�tze

2019 ◽  
Vol 27 (4) ◽  
pp. 539-557
Author(s):  
Barbara Kaltenbacher ◽  
Andrej Klassen ◽  
Mario Luiz Previatti de Souza

Abstract In this paper, we consider the iteratively regularized Gauss–Newton method, where regularization is achieved by Ivanov regularization, i.e., by imposing a priori constraints on the solution. We propose an a posteriori choice of the regularization radius, based on an inexact Newton/discrepancy principle approach, prove convergence and convergence rates under a variational source condition as the noise level tends to zero and provide an analysis of the discretization error. Our results are valid in general, possibly nonreflexive Banach spaces, including, e.g., {L^{\infty}} as a preimage space. The theoretical findings are illustrated by numerical experiments.


2018 ◽  
Vol 26 (5) ◽  
pp. 639-646 ◽  
Author(s):  
Jens Flemming

Abstract We consider Tikhonov-type variational regularization of ill-posed linear operator equations in Banach spaces with general convex penalty functionals. Upper bounds for certain error measures expressing the distance between exact and regularized solutions, especially for Bregman distances, can be obtained from variational source conditions. We prove that such bounds are optimal in case of twisted Bregman distances, a specific a priori parameter choice, and low regularity of the exact solution, that is, the rate function is also an asymptotic lower bound for the error measure. This result extends existing converse results from Hilbert space settings to Banach spaces without adhering to spectral theory.


2018 ◽  
Vol 26 (5) ◽  
pp. 689-702 ◽  
Author(s):  
Christian Clason ◽  
Andrej Klassen

Abstract We consider the method of quasi-solutions (also referred to as Ivanov regularization) for the regularization of linear ill-posed problems in non-reflexive Banach spaces. Using the equivalence to a metric projection onto the image of the forward operator, it is possible to show regularization properties and to characterize parameter choice rules that lead to a convergent regularization method, which includes the Morozov discrepancy principle. Convergence rates in a suitably chosen Bregman distance can be obtained as well. We also address the numerical computation of quasi-solutions to inverse source problems for partial differential equations in {L^{\infty}(\Omega)} using a semi-smooth Newton method and a backtracking line search for the parameter choice according to the discrepancy principle. Numerical examples illustrate the behavior of quasi-solutions in this setting.


2018 ◽  
Vol 26 (2) ◽  
pp. 277-286 ◽  
Author(s):  
Jens Flemming

AbstractVariational source conditions proved to be useful for deriving convergence rates for Tikhonov’s regularization method and also for other methods. Up to now, such conditions have been verified only for few examples or for situations which can be also handled by classical range-type source conditions. Here we show that for almost every ill-posed inverse problem variational source conditions are satisfied. Whether linear or nonlinear, whether Hilbert or Banach spaces, whether one or multiple solutions, variational source conditions are a universal tool for proving convergence rates.


Author(s):  
Stefan Kindermann

AbstractTikhonov regularization in Banach spaces with convex penalty and convex fidelity term for linear ill-posed operator equations is studied. As a main result, convergence rates in terms of the Bregman distance of the regularized solution to the exact solution is proven by imposing a generalization of the established variational inequality conditions on the exact solution. This condition only involves a decay rate of the difference of the penalty functionals in terms of the residual.


Sign in / Sign up

Export Citation Format

Share Document