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

inverse ill-posed problemorder of convergenceregularisation methodsaturation of regularisation methodsspectral method with qualification

Mathematics Subject Classification ID

Linear operators and ill-posed problems, regularization (47A52) 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)

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.

Review text

This paper develops the concept of global saturation for arbitrary regularization methods for inverse ill-posed problems as a formalization based upon the best global order of convergence that a method can achieve independently of the smoothness assumptions on the exact solution and on the selection of the parameter choice rule [cf.\ \textit{A. Neubauer}, ``On converse and saturation results for regularization methods, in: A.\,Schock (ed.), Beiträge zur angewandten Analysis und Informatik.\ Helmut Brakhage zu Ehren (Berichte aus der Mathematik; Aachen: Shaker Verlag), 262--270 (1994; Zbl 0810.65048); \textit{P. Mathé}, SIAM J. Numer. Anal. 42, No.~3, 968--973 (2004; Zbl 1080.47016)]. 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 with respect to the error. Two convergence results are proved. Sufficient conditions for the existence of global saturation for spectral methods with classical qualification of finite positive order and for spectral methods with maximal qualification are derived as applications. Three examples of regularization methods possessing global saturation are presented.

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

• 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
• scientific article; zbMATH DE number 671958 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• 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)

• Generalized qualification and qualification levels for spectral regularization methods
• 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

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)