Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems

In this paper, we introduce two Bregman-type algorithmic frameworks to generalize the extragradient and extrapolation methods. With the help of relative Lipschitzness and the Bregman distance tool, the iteration properties of the proposed frameworks are analyzed. As applied to smooth convex-concave saddle point problems, our theory rediscovers the main results in Mokhtari et al. (2020) [14] for wider frameworks under weaker assumptions via a conceptually different approach.(c) 2022 Elsevier B.V. All rights reserved.