Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution (Q1027252): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.sigpro.2005.05.028 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.sigpro.2005.05.028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996830635 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.SIGPRO.2005.05.028 / rank | |||
Normal rank | |||
Latest revision as of 13:44, 10 December 2024
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
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
