Sparse regularization of inverse problems by operator-adapted frame thresholding

DOI10.1007/978-3-030-47174-3_10arXiv1909.09364MaRDI QIDQ6325672FDOQ6325672

Markus Haltmeier, Jürgen Frikel

Publication date: 20 September 2019

Abstract: We analyze sparse frame based regularization of inverse problems by means of a diagonal frame decomposition (DFD) for the forward operator, which generalizes the SVD. The DFD allows to define a non-iterative (direct) operator-adapted frame thresholding approach which we show to provide a convergent regularization method with linear convergence rates. These results will be compared to the well-known analysis and synthesis variants of sparse $el{l}^1$-regularization which are usually implemented thorough iterative schemes. If the frame is a basis (non-redundant case), the three versions of sparse regularization, namely synthesis and analysis variants of $el{l}^1$ regularization as well as the DFD thresholding are equivalent. However, in the redundant case, those three approaches are pairwise different.

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

This page was built for publication: Sparse regularization of inverse problems by operator-adapted frame thresholding

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