Stepsize Choice for Korpelevich’s and Popov’s Extragradient Algorithms for Convex-Concave Minimax Problems


Wang, Jiaojiao and Xu, Hong-Kun


Full PDF

carpathian_2023_39_1_315_323

We show that the choice of stepsize in Korpelevich’s extragradient algorithm is sharp, while the choice of stepsize in Popov’s extragradient algorithm can be relaxed. We also extend Korpelevich’s extragradient algorithm and Popov’s extragradient algorithm (with larger stepsize) to the infinite-dimensional Hilbert space framework, with weak convergence.

 

 

Additional Information

Author(s)

  Xu, Hong-Kun, Wang, Jiaojiao

DOI

https://doi.org/10.37193/CJM.2023.01.22