%A Radu-Alexandru Dragomir
%A Adrien B. Taylor
%A Alexandre d' Aspremont
%A Jérôme Bolte
%J Mathematical Programming
%T Optimal complexity and certification of Bregman first-order methods
%X We provide a lower bound showing that the O(1/k) convergence rate of the NoLips method (a.k.a. Bregman Gradient or Mirror Descent) is optimal for the class of problems satisfying the relative smoothness assumption. This assumption appeared in the recent developments around the Bregman Gradient method, where acceleration remained an open issue. The main inspiration behind this lower bound stems from an extension of the performance estimation framework of Drori and Teboulle (Mathematical Programming, 2014) to Bregman first-order methods. This technique allows computing worst-case scenarios for NoLips in the context of relatively-smooth minimization. In particular, we used numerically generated worst-case examples as a basis for obtaining the general lower bound.
%P 41-83
%V Vol. 194
%C Berlin
%D 2022
%R 10.1007/s10107-021-01618-1
%I Springer Verlag
%L publications50563