Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59607367, #quickstatements; #temporary_batch_1707303357582 |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: NESUN / rank | |||
Normal rank |
Revision as of 05:19, 28 February 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