A note on the complexity of proximal iterative hard thresholding algorithm (Q259117)
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 note on the complexity of proximal iterative hard thresholding algorithm |
scientific article; zbMATH DE number 6554116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of proximal iterative hard thresholding algorithm |
scientific article; zbMATH DE number 6554116 |
Statements
A note on the complexity of proximal iterative hard thresholding algorithm (English)
0 references
11 March 2016
0 references
\(\ell_0\) regularization
0 references
iterative hard thresholding
0 references
proximal algorithm
0 references
convergence rate
0 references
\(\mathbb{R}\)-linear
0 references
0 references
0 references
0 references
0 references
0.8096816539764404
0 references
0.8005009889602661
0 references
0.780464768409729
0 references
0.7725638151168823
0 references
0.7689753174781799
0 references
