Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity |
scientific article |
Statements
Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (English)
0 references
10 July 2019
0 references
structured nonsmooth convex optimization
0 references
first-order black-box oracle
0 references
estimation sequence
0 references
strong convexity
0 references
optimal complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
