Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457): Difference between revisions
From MaRDI portal
Latest revision as of 22:38, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal subgradient algorithms for large-scale convex optimization in simple domains |
scientific article |
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