Convergence rates of convex variational regularization
Top Cited Papers
- 20 July 2004
- journal article
- Published by IOP Publishing in Inverse Problems
- Vol. 20 (5) , 1411-1421
- https://doi.org/10.1088/0266-5611/20/5/005
Abstract
The aim of this paper is to provide quantitative estimates for the minimizers of non-quadratic regularization problems in terms of the regularization parameter respectively the noise level. As usual for ill- posed inverse problems, these estimates can be obtained only under additional smoothness assumptions on the data, so-called source con- ditions, which we identify with the existence of Lagrange multipliers for a limit problem. Under such a source condition, we shall prove a quantitative estimate for the Bregman distance induced by the regular- ization functional, which turns out to be the natural distance measure to use in this case. We put a special emphasis on the case of total variation regulariza- tion, which is probably the most important and prominent example in this class. We discuss the source condition for this case in detail and verify that it still allows discontinuities in the solution, while imposing some regularity on its level sets. Keywords: Regularization, Bregman Distances, Total Variation AMS Subject Classiflcation: 47A52, 65J20, 49M30Keywords
This publication has 17 references indexed in Scilit:
- APPROXIMATION BY PIECEWISE CONSTANT FUNCTIONS IN A BV METRICMathematical Models and Methods in Applied Sciences, 2003
- Regularization by Functions of Bounded Variation and Applications to Image EnhancementApplied Mathematics & Optimization, 1999
- Image recovery via total variation minimization and related problemsNumerische Mathematik, 1997
- Regularization of linear least squares problems by total bounded variationESAIM: Control, Optimisation and Calculus of Variations, 1997
- Analysis of regularized total variation penalty methods for denoisingInverse Problems, 1996
- Regularization of Inverse ProblemsPublished by Springer Nature ,1996
- Analysis of bounded variation penalty methods for ill-posed problemsInverse Problems, 1994
- Maximum Entropy Regularization for Fredholm Integral Equations of the First KindSIAM Journal on Mathematical Analysis, 1993
- Maximum entropy regularization of Fredholm integral equations of the first kindInverse Problems, 1991
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967