A dual split Bregman method for fast $\ell ^1$ minimization (Q5326502): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1090/s0025-5718-2013-02700-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072238928 / rank | |||
Normal rank | |||
Latest revision as of 10:14, 30 July 2024
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
0 references
0 references
