An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906)
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 7057749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal subgradient algorithm with subspace search for costly convex optimization problems |
scientific article; zbMATH DE number 7057749 |
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
0.8091686964035034
0 references
0.7911706566810608
0 references
0.789867103099823
0 references
0.7751768827438354
0 references
