An iterative thresholding algorithm for linear inverse problems with a sparsity constraint (Q4651902): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115706991 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0307152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topographic Independent Component Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488070 / rank
 
Normal rank

Latest revision as of 17:59, 7 June 2024

scientific article; zbMATH DE number 2137928
Language Label Description Also known as
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
    0 references
    0 references
    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 references
    0 references
    0 references
    0 references

    Identifiers

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