Three strong convergence theorems regarding iterative methods for solving equilibrium problems in reflexive Banach spaces (Q2906492)

Let \(K\) be a closed and convex subset of a reflexive Banach space \(X\)and \(g:K\times K \rightarrow \mathbb{R}\) be a bifunction. The equilibrium problem corresponding to \(g\) is to find \(\overline{x} \in K\) such that NEWLINE\[NEWLINE g(\overline{x},y)\geq 0\text{ for all }y \in K. \tag{1}NEWLINE\]NEWLINE Problem (1) contains as special cases many problems in optimization theory, in fixed point theory and in variational analysis.NEWLINENEWLINEIn the present paper, the authors propose three new algorithms for solving (common) equilibrium problems in general reflexive Banach spaces by using an appropriate convex function \(f\), as well as the Bregman distance and its associated projection.NEWLINENEWLINEThe proposed algorithms are more flexible than the ones existing in the literature because they allow to choose the fitting function \(f\) according to the nature of the bifunction \(g\) and of the ambient space \(X\).NEWLINENEWLINEFor the entire collection see [Zbl 1241.00017].