An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal subgradient algorithm for large-scale bound-constrained convex optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal subgradient algorithm for large-scale bound-constrained convex optimization |
scientific article |
Statements
An optimal subgradient algorithm for large-scale bound-constrained convex optimization (English)
0 references
10 October 2017
0 references
bound-constrained convex optimization
0 references
nonsmooth optimization
0 references
first-order black-box oracle
0 references
subgradient methods
0 references
optimal complexity
0 references
high-dimensional data
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8392274975776672
0 references
0.8241302371025085
0 references
0.822587788105011
0 references
0.8091686964035034
0 references
0.7731418609619141
0 references
