Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457)
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 6825433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal subgradient algorithms for large-scale convex optimization in simple domains |
scientific article; zbMATH DE number 6825433 |
Statements
Optimal subgradient algorithms for large-scale convex optimization in simple domains (English)
0 references
12 January 2018
0 references
structured convex optimization
0 references
nonsmooth optimization
0 references
optimal complexity
0 references
first-order black-box information
0 references
subgradient method
0 references
high-dimensional data
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8392274975776672
0 references
0.8120082020759583
0 references
0.8028854727745056
0 references
0.8026497960090637
0 references
