Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm (Q2268312): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:36, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm |
scientific article |
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
