A Bregman iterative algorithm for solving \(l^1\) minimization problems (Q2859933)
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 Bregman iterative algorithm for solving l^1 minimization problems |
scientific article; zbMATH DE number 6230341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Bregman iterative algorithm for solving \(l^1\) minimization problems |
scientific article; zbMATH DE number 6230341 |
Statements
19 November 2013
0 references
minimization problems
0 references
Bregman iterative algorithm
0 references
Tikhonov regularization
0 references
A Bregman iterative algorithm for solving \(l^1\) minimization problems (English)
0 references
0.8428216576576233
0 references
0.810457706451416
0 references
0.8044032454490662
0 references
0.8025007247924805
0 references
0.79954993724823
0 references
