A dual split Bregman method for fast $\ell ^1$ minimization (Q5326502)
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: A dual split Bregman method for fast $\ell ^1$ minimization |
scientific article; zbMATH DE number 6195247
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual split Bregman method for fast $\ell ^1$ minimization |
scientific article; zbMATH DE number 6195247 |
Statements
A dual split Bregman method for fast $\ell ^1$ minimization (English)
0 references
6 August 2013
0 references
\(\ell^1\)-minimization
0 references
optimization algorithms
0 references
sparsity
0 references
compressed sensing
0 references
calculus of variation
0 references
