Publication Cover
Applicable Analysis
An International Journal
Volume 86, 2007 - Issue 5
91
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

On regularization methods based on dynamic programming techniques

&
Pages 611-632 | Received 30 Sep 2006, Accepted 23 Apr 2007, Published online: 30 May 2007
 

Abstract

In this article, we investigate the connection between regularization theory for inverse problems and dynamic programming theory. This is done by developing two new regularization methods, based on dynamic programming techniques. The aim of these methods is to obtain stable approximations to the solution of linear inverse ill-posed problems. We follow two different approaches and derive a continuous and a discrete regularization method. Regularization properties for both methods are proved as well as rates of convergence. A numerical benchmark problem concerning integral operators with convolution kernels is used to illustrate the theoretical results.

Acknowledgments

The work of S.K. is supported by Austrian Science Foundation under grant SFB F013/F1317; the work of A.L. is supported by the Austrian Academy of Sciences and by CNPq, grant 306020/06-8 and 478099/04-5.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.