Regularization by dynamic programming

From MaRDI portal
Publication:5427273

DOI10.1515/JIIP.2007.016zbMATH Open1126.35099arXiv2101.10325OpenAlexW3122009672WikidataQ126244486 ScholiaQ126244486MaRDI QIDQ5427273FDOQ5427273

A. Leitão, Stefan Kindermann

Publication date: 19 November 2007

Published in: Journal of Inverse and Ill-posed Problems (Search for Journal in Brave)

Abstract: We investigate continuous regularization methods for linear inverse problems of static and dynamic type. These methods are based on dynamic programming approaches for linear quadratic optimal control problems. We prove regularization properties and also obtain rates of convergence for our methods. A numerical example concerning a dynamical electrical impedance tomography (EIT) problem is used to illustrate the theoretical results.


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




Recommendations





Cited In (9)





This page was built for publication: Regularization by dynamic programming

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