For most large underdetermined systems of linear equations the minimal ๐“<sub>1</sub>โ€norm solution is also the sparsest solution (Q5471032): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
ย 

Revision as of 02:56, 7 March 2024

scientific article; zbMATH DE number 5029890
Language Label Description Also known as
English
For most large underdetermined systems of linear equations the minimal ๐“<sub>1</sub>โ€norm solution is also the sparsest solution
scientific article; zbMATH DE number 5029890

    Statements

    For most large underdetermined systems of linear equations the minimal ๐“<sub>1</sub>โ€norm solution is also the sparsest solution (English)
    0 references
    0 references
    6 June 2006
    0 references
    solution of underdetermined linear systems
    0 references
    overcomplete representations
    0 references
    minimum \(l_1\)-decomposition
    0 references
    sparse representation problem
    0 references
    almost-Euclidean sections of Banach spaces
    0 references
    eigenvalues of random matrices
    0 references
    sign-embeddings in Banach spaces
    0 references
    greedy algorithms
    0 references
    matching pursuit
    0 references
    basis pursuit
    0 references

    Identifiers

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