On Korpelevich’s extragradient algorithm

Abstract

We provide quantitative results on the convergence of the extragradient algorithm of Korpelevich in the form of a computable and highly uniform rate of metastability (in the sense of T. Tao) as well as, under a general metric regularity assumption in the sense of U. Kohlenbach, G. López-Acedo and A. Nicolae, even in the form of a rate of convergence.