Hybrid proximal point and extragradient algorithms for solving equilibrium problems (Q490021): Difference between revisions

The authors consider the equilibrium problems in Hilbert spaces in the sense of \textit{E. Blum} and \textit{W. Oettli} [Math. Stud. 63, No. 1--4, 123--145 (1994; Zbl 0888.49007)] which are presented as follows: Find \(x ^{*} \in C\) such that \(F(x^{*},y) \geq 0\) for all \(y\in C\); and: Find \(\overline{x} \in C\) such that \(f (\overline{x}, y) \geq 0\) for all \(y \geq C\). Here, \(F\) and \(f\) are two bifunctions such that \(F(x,y)=0\) and \(f(x,y)=0\) for all \(x \in C\). The authors propose new iteration methods for finding a common point of the solution set of a pseudomonotone equilibrium problem and the solution set of a monotone equilibrium problem. The methods are based on both the extragradient-type methods and the viscosity approximation method.