Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352)
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 6872318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) |
scientific article; zbMATH DE number 6872318 |
Statements
Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (English)
0 references
24 May 2018
0 references
structured nonsmooth convex optimization
0 references
subgradient methods
0 references
proximity operator
0 references
optimal complexity
0 references
first-order black-box information
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7862607836723328
0 references
0.786141037940979
0 references
0.7818254828453064
0 references
0.7744123935699463
0 references
0.7735780477523804
0 references
