text:   Inequalities",4,"['Very excited about our new paper with @ArgyrisOikonom1 @WeiqiangZheng3.\n\nWe obtain the tight last-iterate convergence rates for the Extragradient (EG) and Optimistic Gradient (OG) algorithms, settling an open problem raised by @KonstDaskalakis.\n<LINK>', ""We study the convex-concave min-max optimization  (and more generally the monotone variation inequalities) in the constrained setting. The EG algorithm by Korpelevich '1976 and the OG algorithm by Popov '1980 are among the most classical and popular algorithms for such problems."", 'For both EG and OG, we know that the last-iterate asymptotically converges, but the rate was not known despite having been studied for a long time. We obtain tight last-iterate convergence rates for both EG and OG.', 'Our proof builds on a new natural potential function, whose monotonicity is established using a sum-of-squares programming based computer-aided proof.\n\nFor more details, see my talk at the Simons Institute for our result on EG.\nhttps://t.co/eMr8KJmdtT']",22,04,978