Global saturation of regularization methods for inverse ill-posed problems

From MaRDI portal
Publication:630010

DOI10.1007/S10957-010-9739-5zbMATH Open1225.47013arXiv1008.0108OpenAlexW3103476046MaRDI QIDQ630010FDOQ630010

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

Publication date: 10 March 2011

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

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.


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





Cites Work


Cited In (1)


   Recommendations





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)