For most large underdetermined systems of equations, the minimal š“<sub>1</sub>ā€norm nearā€solution approximates the sparsest nearā€solution (Q5486262)

From MaRDI portal
Revision as of 18:56, 24 June 2024 by ReferenceBot (talk | contribs) (ā€ŽChanged an Item)
(diff) ā† Older revision | Latest revision (diff) | Newer revision ā†’ (diff)
scientific article; zbMATH DE number 5051894
Language Label Description Also known as
English
For most large underdetermined systems of equations, the minimal š“<sub>1</sub>ā€norm nearā€solution approximates the sparsest nearā€solution
scientific article; zbMATH DE number 5051894

    Statements

    For most large underdetermined systems of equations, the minimal š“<sub>1</sub>ā€norm nearā€solution approximates the sparsest nearā€solution (English)
    0 references
    0 references
    6 September 2006
    0 references
    combinatorial optimization
    0 references
    0 references

    Identifiers