Regularization by dynamic programming

DOI10.1515/JIIP.2007.016MaRDI QIDQ5427273zbMATH OpenOpenAlexWikidataFDO

Authors Stefan Kindermann, A. Leitão

Publication date 19 November 2007

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

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

zbMATH Keywords

dynamical electrical impedance tomographydynamical source identificationlinear quadratic optimal control problems

Mathematics Subject Classification ID

Inverse problems for PDEs (35R30) Linear operators and ill-posed problems, regularization (47A52) Dynamic programming in optimal control and differential games (49L20) Linear optimal control problems (49N05)

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.

Recommendations

• On regularization methods based on dynamic programming techniques
• On a modification of the dynamic regularization method
• Discrete regularization
• scientific article; zbMATH DE number 4046973
• Methods of regularization in nonsmooth problems of dynamic optimization
• On computational schemes of the regularization method
• scientific article; zbMATH DE number 3965337
• Rough Sets and Current Trends in Computing
• Regularization of linear regression problems
• scientific article; zbMATH DE number 418822

Cited in

(11)

• Regularization methods in dynamic MRI
• Discrete regularization
• Dynamic regularization of input estimation problems by explicit block inversion
• The regularization property and the computational solution of the dynamic measure problem
• scientific article; zbMATH DE number 3928243 (Why is no real title available?)
• Regularization in state space
• Efficient algorithms for the regularization of dynamic inverse problems: II. Applications
• On the relation between constraint regularization, level sets, and shape optimization
• On Regularization Methods for Inverse Problems of Dynamic Type
• On regularization methods based on dynamic programming techniques
• Dynamic regularization, level set shape optimization, and computed myography

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)