Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution (Q1027252)

From MaRDI portal
Revision as of 01:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
scientific article

    Statements

    Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution (English)
    0 references
    0 references
    0 references
    1 July 2009
    0 references
    basis pursuit
    0 references
    underdetermined systems of linear equations
    0 references
    random matrix theory
    0 references
    linear programming
    0 references
    overcomplete systems
    0 references
    sparse representations
    0 references
    random signs matrix ensemble
    0 references
    partial Fourier matrix ensemble
    0 references
    partial Hadamard matrix ensemble
    0 references

    Identifiers