Iterative thresholding algorithms (Q942154)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterative thresholding algorithms |
scientific article; zbMATH DE number 5321388
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative thresholding algorithms |
scientific article; zbMATH DE number 5321388 |
Statements
Iterative thresholding algorithms (English)
0 references
4 September 2008
0 references
The article provides a variational formulation for hard and firm thresholding. A related functional can be used to regularize linear inverse problems by sparsity constraints. It is shown that a damped hard or firm thresholded Landweber iteration converges to its minimizer.
0 references
linear inverse problems
0 references
thresholded Landweber iteration
0 references
frames
0 references
variational calculus on sequence spaces
0 references
\(\Gamma\)-convergence
0 references
joint sparsity
0 references
0 references
0 references
0 references
0 references
0 references
0.92349505
0 references
0.9048822
0 references
0.9009044
0 references
0.8932218
0 references
0.8916086
0 references
0.88846385
0 references
0.88198185
0 references
