\(A^-\)-linearized Bregman iteration algorithm (Q3071307)
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^--linearized Bregman iteration algorithm |
scientific article; zbMATH DE number 5846434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(A^-\)-linearized Bregman iteration algorithm |
scientific article; zbMATH DE number 5846434 |
Statements
5 February 2011
0 references
basis pursuit
0 references
linearized Bregman iteration
0 references
compressed sensing
0 references
optimization
0 references
0.9000908732414246
0 references
0.8978754281997681
0 references
0.8406507968902588
0 references
0.8397821187973022
0 references
0.8354069590568542
0 references
