A note on the complexity of proximal iterative hard thresholding algorithm (Q259117): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:51, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of proximal iterative hard thresholding algorithm |
scientific article |
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
