15 citations · 27 across the 7 of their papers we have counts for
7 papers · 1 filter
A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration
Simon Hubmer, Ekaterina Sherina, Stefan Kindermann +1
The choice of a suitable regularization parameter is an important part of most regularization methods for inverse problems. In the absence of reliable estimates of the noise level,…
Tensor Deblurring and Denoising Using Total Variation
Fatoumata Sanogo, Carmeliza Navasca, Stefan Kindermann
We consider denoising and deblurring problems for tensors. While images can be discretized as matrices, the analogous procedure for color images or videos leads to a tensor formula…
The Hausdorff Moment Problem in the light of ill-posedness of type I
Daniel Gerth, Bernd Hofmann, Christopher Hofmann +1
The Hausdorf moment problem (HMP) over the unit interval in an -setting is a classical example of an ill-posed inverse problem. Since various applications can be rewritten in…
On regularization methods based on dynamic programming techniques
S. Kindermann, A. Leitao
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 m…
On regularization methods for inverse problems of dynamic type
S. Kindermann, A. Leitao
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 opt…
Optimal-order convergence of Nesterov acceleration for linear ill-posed problems
Stefan Kindermann
We show that Nesterov acceleration is an optimal-order iterative regularization method for linear ill-posed problems provided that a parameter is chosen accordingly to the smoothne…