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
Created claim: Wikidata QID (P12): Q29392029, #quickstatements; #temporary_batch_1711234560214 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q2760174 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremes and related properties of random sequences and processes / rank | |||
Normal rank | |||
Latest revision as of 15:33, 24 June 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
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
