An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal subgradient algorithm with subspace search for costly convex optimization problems |
scientific article |
Statements
An optimal subgradient algorithm with subspace search for costly convex optimization problems (English)
0 references
23 May 2019
0 references
convex optimization
0 references
nonsmooth optimization
0 references
subgradient methods
0 references
multidimensional subspace search
0 references
optimal complexity
0 references
first-order black-box information
0 references
costly linear operator
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
