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 a new Item ย |
โChanged an Item |
||
| Property / describes a project that uses | |||
| ย | |||
| Property / describes a project that uses: lars / rank | |||
| ย | Normal rank | ||
Revision as of 07:47, 28 February 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
