Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708)

From MaRDI portal
Revision as of 18:36, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
scientific article

    Statements

    Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (English)
    0 references
    0 references
    0 references
    17 December 2007
    0 references
    0 references
    sparse approximations
    0 references
    greedy algorithm
    0 references
    basis pursuit algorithm
    0 references
    linear programming
    0 references
    multichannel representations
    0 references
    sparse component analysis
    0 references