Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm (Q2268312)

From MaRDI portal
Revision as of 10:11, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
scientific article

    Statements

    Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm (English)
    0 references
    0 references
    0 references
    10 March 2010
    0 references
    basis pursuit
    0 references
    shrinkage
    0 references
    greedy sweep
    0 references
    Bregman iteration
    0 references
    constrained problem
    0 references

    Identifiers