Global saturation of regularization methods for inverse ill-posed problems

DOI10.1007/S10957-010-9739-5MaRDI QIDQ630010zbMATH OpenOpenAlexFDO

Authors R. D. Spies, K. G. Temperini, Terry L. Herdman

Publication date 10 March 2011

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.0108

zbMATH Keywords

order of convergenceinverse ill-posed problemregularisation methodsaturation of regularisation methodsspectral method with qualification

Mathematics Subject Classification ID

Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22) Programming in abstract spaces (90C48) Linear operators and ill-posed problems, regularization (47A52)

Abstract: In this article the concept of saturation of an arbitrary regularization method is formalized based upon the original idea of saturation for spectral regularization methods introduced by A. Neubauer in 1994. Necessary and sufficient conditions for a regularization method to have global saturation are provided. It is shown that for a method to have global saturation the total error must be optimal in two senses, namely as optimal order of convergence over a certain set which at the same time, must be optimal (in a very precise sense) with respect to the error. Finally, two converse results are proved and the theory is applied to find sufficient conditions which ensure the existence of global saturation for spectral methods with classical qualification of finite positive order and for methods with maximal qualification. Finally, several examples of regularization methods possessing global saturation are shown.

Recommendations

• On the existence of global saturation for spectral regularization methods with optimal qualification
• Generalized qualification and qualification levels for spectral regularization methods
• scientific article; zbMATH DE number 970492
• A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition
• Extra-optimal methods for solving ill-posed problems: survey of theory and examples
• Iterated Tikhonov regularization for ill-posed problems
• Regularization of inverse magnetostatic problems: possibilities and pitfalls
• scientific article; zbMATH DE number 618067
• Why a minimizer of the Tikhonov functional is closer to the exact solution than the first guess
• scientific article; zbMATH DE number 409766

Cites work

• scientific article; zbMATH DE number 671958 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• Arbitrary divergence speed of the least-squares method in infinite-dimensional inverse ill-posed problems
• Generalized qualification and qualification levels for spectral regularization methods
• Geometry of linear ill-posed problems in variable Hilbert scales
• Nonconvergence results for the application of least-squares estimation to ill-posed problems
• On Converse and Saturation Results for Tikhonov Regularization of Linear Ill-Posed Problems
• Optimal discretization of inverse problems in Hilbert scales. Regularization and self-regulari\-za\-tion of projection methods
• Saturation of Regularization Methods for Linear Ill-Posed Problems in Hilbert Spaces

Cited in

(4)

• On elimination of accuracy saturation of regularizing algorithms
• scientific article; zbMATH DE number 671958 (Why is no real title available?)
• On the existence of global saturation for spectral regularization methods with optimal qualification
• Generalized qualification and qualification levels for spectral regularization methods

This page was built for publication: Global saturation of regularization methods for inverse ill-posed problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630010)