From error bounds to the complexity of first-order descent methods for convex functions (Q1675251): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: UNLocBoX / rank | |||
Normal rank | |||
Revision as of 04:57, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From error bounds to the complexity of first-order descent methods for convex functions |
scientific article |
Statements
From error bounds to the complexity of first-order descent methods for convex functions (English)
0 references
27 October 2017
0 references
error bounds
0 references
convex minimization
0 references
forward-backward method
0 references
KL inequality
0 references
complexity of first-order methods
0 references
LASSO
0 references
compressed sensing
0 references
