The least error method for sparse solution reconstruction

DOI10.1088/0266-5611/32/9/094001MaRDI QIDQ2832966zbMATH OpenOpenAlexWikidataFDO

Authors K. Bredies, Barbara Kaltenbacher, Elena Resmerita

Publication date 15 November 2016

Published in Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

convergenceerror estimatesleast error methodlinear ill-posed problemsregularization methodsource conditionsparsity

Mathematics Subject Classification ID

Linear operators and ill-posed problems, regularization (47A52) Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Abstract: This work deals with a regularization method enforcing solution sparsity of linear ill-posed problems by appropriate discretization in the image space. Namely, we formulate the so called least error method in an $el{l}^1$ setting and perform the convergence analysis by choosing the discretization level according to an a priori rule, as well as two a posteriori rules, via the discrepancy principle and the monotone error rule, respectively. Depending on the setting, linear or sublinear convergence rates in the $el{l}^1$-norm are obtained under a source condition yielding sparsity of the solution. A part of the study is devoted to analyzing the structure of the approximate solutions and of the involved source elements.

Review text

The authors describe a regularization method for obtaining sparse solutions to linear ill-posed problems, by appropriate discretization in the image space. The method is also known as the least error method in the literature. A convergence analysis is provided for one a priori and two a posteriori rules for choosing the proper discretization level. The paper also contains a discussion about the structure of the approximate solutions and the source elements.

Recommendations

• On the role of sparsity in inverse problems
• Convergence rates for regularization with sparsity constraints
• Convergence rates in ^1-regularization if the sparsity assumption fails
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Tikhonov regularization with \({\ell^{0}}\)-term complementing a convex penalty: \({\ell^{1}}\)-convergence under sparsity constraints

Cited in

(3)

• Sparsity of solutions for variational inverse problems with finite-dimensional data
• A criterion for the construction of a regularization function in sparse component analysis
• scientific article; zbMATH DE number 7156643 (Why is no real title available?)

This page was built for publication: The least error method for sparse solution reconstruction

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