Iterative thresholding algorithms (Q942154)

From MaRDI portal
Revision as of 21:04, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Iterative thresholding algorithms
scientific article

    Statements

    Iterative thresholding algorithms (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references