NAOct 28, 2012
Convergence rates in $\mathbf{\ell^1}$-regularization if the sparsity assumption failsMartin Burger, Jens Flemming, Bernd Hofmann
Variational sparsity regularization based on $\ell^1$-norms and other nonlinear functionals has gained enormous attention recently, both with respect to its applications and its mathematical analysis. A focus in regularization theory has been to develop error estimation in terms of regularization parameter and noise strength. For this sake specific error measures such as Bregman distances and specific conditions on the solution such as source conditions or variational inequalities have been developed and used. In this paper we provide, for a certain class of ill-posed linear operator equations, a convergence analysis that works for solutions that are not completely sparse, but have a fast decaying nonzero part. This case is not covered by standard source conditions, but surprisingly can be treated with an appropriate variational inequality. As a consequence the paper also provides the first examples where the variational inequality approach, which was often believed to be equivalent to appropriate source conditions, can indeed go farther than the latter.
FAJan 12, 2017
Injectivity and weak*-to-weak continuity suffice for convergence rates in $\ell^1$-regularizationJens Flemming, Daniel Gerth
We show that the convergence rate of $\ell^1$-regularization for linear ill-posed equations is always $O(δ)$ if the exact solution is sparse and if the considered operator is injective and weak*-to-weak continuous. Under the same assumptions convergence rates in case of non-sparse solutions are proven. The results base on the fact that certain source-type conditions used in the literature for proving convergence rates are automatically satisfied.
NADec 5, 2017
A converse result for Banach space convergence rates in Tikhonov-type convex regularization of ill-posed linear equationsJens Flemming
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, 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.
NASep 18, 2017
There always is a variational source condition for nonlinear problems in Banach spacesJens Flemming
Variational source conditions proved 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 handled by classical techniques, too. 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.