Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints (Q4973261)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints |
scientific article; zbMATH DE number 7139192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints |
scientific article; zbMATH DE number 7139192 |
Statements
Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints (English)
0 references
2 December 2019
0 references
adaptive mirror descent method
0 references
Lipschitz condition
0 references
Lipschitz gradient
0 references
Lipschitz Hessian
0 references
strongly convex function
0 references
technique of restarts
0 references
0 references
0.873545229434967
0 references
0.8718791007995605
0 references
0.8605846762657166
0 references
0.8380797505378723
0 references
0.8145058751106262
0 references
