Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory

Gabor Braun, Sebastian Pokutta, Cristóbal Andrés Guzmán Paredes

Research output: Contribution to journal › Article › Academic › peer-review

18 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory'. Together they form a unique fingerprint.