Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1077.65055
Daubechies, Ingrid; Defrise, Michel; De Mol, Christine
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
(English)
[J] Commun. Pure Appl. Math. 57, No. 11, 1413-1457 (2004). ISSN 0010-3640

The linear inverse problem corresponding to an equation $Kf=h$ with a bounded linear operator $K:H\to L^2(\Omega)$ on a Hilbert space $H$ consists in finding an estimate of $f$ from not exactly given $h$. One of the best known methods of solving such (possibly ill-posed) problems is the Tikhonov regularization method where a regularization functional has to be minimized which is a sum of discrepancy and additional quadratic constraints multiplied by the regularization parameter. The authors present a new method which is a generalization of the Tikhonov method. Namely, in place of classical quadratic constraints, a weighted $l^p$-norm ($1\le p\le2$) of expansion coefficients of $f$ with respect to a particular orthogonal basis in $H$ is taken as a penalization term added to the discrepancy in the regularization functional. The proposed minimization procedure promotes sparsity of the expansion of $f$ with respect to the basis under consideration. Wavelet bases as well as other orthogonal bases are taken into account. \par To compute the corresponding regularized solution, the authors propose an iterative algorithm for solving a system of nonlinear equations related to the minimizing problem for the regularization functional. The detailed and full mathematical analysis of the proposed method is given. The strong convergence of successive iterates to the minimizer of the regularization functional is proved and stability of regularized solution is shown. The presented general regularization theorem establishes the convergence to the exact solution as the noise level tends to zero. Under some additional a priori assumptions error estimates are derived. Moreover, possible generalizations as well as the numerical complexity of the algorithm are discussed. In the Appendix a brief review of basic definitions of wavelets and their connection with Besov spaces is given.
[Teresa Regińska (Warszawa)]
MSC 2000:
*65J10 Equations with linear operators (numerical methods)
65J22 Inverse problems
65J20 Improperly posed problems (numerical methods in abstract spaces)
47A52 Ill-posed problems etc.
42C40 Wavelets
65T60 Wavelets

Keywords: linear inverse problems; regularization; generalization of the Tikhonov method; nonquadratic constraints; sparse extension; wavelets; iterative algorithm; thresholding; ill-posed problem; convergence; stability; Hilbert space

Highlights
Master Server