Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm (Q2268312): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.3934/ipi.2009.3.487 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3934/ipi.2009.3.487 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2787198218 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.3934/IPI.2009.3.487 / rank | |||
Normal rank | |||
Latest revision as of 18:17, 17 December 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
