DeepAI
Log In Sign Up

On regularization methods for inverse problems of dynamic type

01/22/2021
by   S. Kindermann, et al.
0

In this paper we consider new regularization methods for linear inverse problems of dynamic type. These methods are based on dynamic programming techniques for linear quadratic optimal control problems. Two different approaches are followed: a continuous and a discrete one. We prove regularization properties and also obtain rates of convergence for the methods derived from both approaches. A numerical example concerning the dynamic EIT problem is used to illustrate the theoretical results.

READ FULL TEXT

page 20

page 21

page 25

01/22/2021

Regularization by dynamic programming

We investigate continuous regularization methods for linear inverse prob...
04/09/2020

On the asymptotical regularization for linear inverse problems in presence of white noise

We interpret steady linear statistical inverse problems as artificial dy...
11/14/2020

On the relation between constraint regularization, level sets, and shape optimization

We consider regularization methods based on the coupling of Tikhonov reg...
01/05/2017

A Matrix Factorization Approach for Learning Semidefinite-Representable Regularizers

Regularization techniques are widely employed in optimization-based appr...
01/22/2021

On regularization methods based on dynamic programming techniques

In this article we investigate the connection between regularization the...
07/12/2021

Efficient edge-preserving methods for dynamic inverse problems

We consider efficient methods for computing solutions to dynamic inverse...
12/21/2020

A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization

We develop a dynamic generalized conditional gradient method (DGCG) for ...