Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution (Q1027252)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Breakdown of equivalence between the minimal ^1-norm solution and the sparsest solution |
scientific article; zbMATH DE number 5573416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution |
scientific article; zbMATH DE number 5573416 |
Statements
Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution (English)
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
0.8885743021965027
0 references
0.8364406824111938
0 references
0.8077921271324158
0 references
0.7865930795669556
0 references
0.7802085876464844
0 references
