Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm (Q2268312)
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 5679621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm |
scientific article; zbMATH DE number 5679621 |
Statements
Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm (English)
0 references
10 March 2010
0 references
basis pursuit
0 references
shrinkage
0 references
greedy sweep
0 references
Bregman iteration
0 references
constrained problem
0 references
0.91284645
0 references
0.9110472
0 references
0.9098689
0 references
0.90967596
0 references
0.9021858
0 references
0.89945734
0 references
0.89937973
0 references
0.8991986
0 references
0.8897933
0 references
