Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” | IEEE Journals & Magazine | IEEE Xplore