Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing (Q5453521)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5256573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing |
scientific article; zbMATH DE number 5256573 |
Statements
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing (English)
0 references
1 April 2008
0 references
\(\ell_1\)-minimization
0 references
basis pursuit
0 references
compressed sensing
0 references
iterative regularisation
0 references
Bregman distances
0 references
0.897068977355957
0 references
0.88166743516922
0 references
0.8761347532272339
0 references
0.8539595603942871
0 references
0.8509063124656677
0 references
