Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory (Q5358597)
From MaRDI portal
scientific article; zbMATH DE number 6777882
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory |
scientific article; zbMATH DE number 6777882 |
Statements
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory (English)
0 references
21 September 2017
0 references