Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems

In this paper, two splitting extragradient-like algorithms for solving strongly pseudomonotone equilibrium problems given by a sum of two bifunctions are proposed. The convergence of the proposed methods is analyzed and the R-linear rate of convergence under suitable assumptions on bifunctions is established. Moreover, a noisy data case, when a part of the bifunction is contaminated by errors, is studied. Finally, some numerical experiments are given to demonstrate the efficiency of our algorithms.