Extragradient method in optimization: convergence and complexity

Abstract

We consider the extragradient method to minimize the sum of two functions, the first one being smooth and the second being convex. Under the Kurdyka-Aojasiewicz assumption, we prove that the sequence produced by the extragradient method converges to a cri