OSGA: a fast subgradient algorithm with optimal complexity (Q304218)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | OSGA: a fast subgradient algorithm with optimal complexity |
scientific article |
Statements
OSGA: a fast subgradient algorithm with optimal complexity (English)
0 references
25 August 2016
0 references
complexity bound
0 references
convex optimization
0 references
optimal subgradient method
0 references
large-scale optimization
0 references
Nesterov's optimal method
0 references
nonsmooth optimization
0 references
optimal first-order method
0 references
smooth optimization
0 references
strongly convex
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
