Variational Regularization Theory Based on Image Space Approximation Rates
arXiv:2009.00490 · doi:10.1088/1361-6420/abf5bb
Abstract
We present a new approach to convergence rate results for variational regularization. Avoiding Bregman distances and using image space approximation rates as source conditions we prove a nearly minimax theorem showing that the modulus of continuity is an upper bound on the reconstruction error up to a constant. Applied to Besov space regularization we obtain convergence rate results for - and -penalties without restrictions on Finally we prove equivalence of Hölder-type variational source conditions, bounds on the defect of the Tikhonov functional, and image space approximation rates.
References in corpus (4)
- Convergence rates in expectation for Tikhonov-type regularization of Inverse Problems with Poisson data
- Characterizations of variational source conditions, converse results, and maxisets of spectral regularization methods
- Optimal convergence rates for sparsity promoting wavelet-regularization in Besov spaces
- Penalty-based smoothness conditions in convex variational regularization