OSGA: a fast subgradient algorithm with optimal complexity (Q304218)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6619156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | OSGA: a fast subgradient algorithm with optimal complexity |
scientific article; zbMATH DE number 6619156 |
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
0.8241302371025085
0 references
0.8120082020759583
0 references
0.7921881675720215
0 references
0.7911706566810608
0 references
0.789512574672699
0 references
