An iterative thresholding algorithm for linear inverse problems with a sparsity constraint (Q4651902)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2137928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative thresholding algorithm for linear inverse problems with a sparsity constraint |
scientific article; zbMATH DE number 2137928 |
Statements
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint (English)
0 references
23 February 2005
0 references
linear inverse problems
0 references
regularization
0 references
generalization of the Tikhonov method
0 references
nonquadratic constraints
0 references
sparse extension
0 references
wavelets
0 references
iterative algorithm
0 references
thresholding
0 references
ill-posed problem
0 references
convergence
0 references
stability
0 references
Hilbert space
0 references
0.8843656778335571
0 references
0.8587526679039001
0 references
0.8562636375427246
0 references
0.8521015048027039
0 references
0.8521002531051636
0 references
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\leq p\leq2\)) 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. 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.
0 references