Parallel extragradient algorithms for multiple set split equilibrium problems in Hilbert spaces (Q2413277)

The following multiple set split variational inequality problem was proposed and solved by \textit{Y. Censor} et al. [Numer. Algorithms 59, No. 2, 301--323 (2012; Zbl 1239.65041)]: Find \(x^{\ast }\in C:=\bigcap\limits_{i=1}^{N}C_{i}\) such that \[ \left\langle F_{i}\left( x^{\ast }\right) ,y-x^{\ast }\right\rangle \geq 0,\forall y\in C_{i},\forall i\in \left\{ 1,\dots,N\right\}, \] and such that the point \[ u^{\ast }=Ax^{\ast }\in Q:=\bigcap\limits_{j=1}^{M}Q_{j} \] satisfies \[ \left\langle G_{j}\left( u^{\ast }\right) ,v-u^{\ast }\right\rangle \geq 0,\forall v\in Q_{j},\forall j\in \left\{ 1,\dots,M\right\}, \] where \(A:H_{1}\longrightarrow H_{2}\) is a bounded linear operator, with \( H_{1}\) and \(H_{2}\) being two given real Hilbert spaces,\ \( F_{i}:H_{1}\longrightarrow H_{1}\), \(i=1,\dots,N\), and \(G_{j}:H_{2} \longrightarrow H_{2}\), \(j=1,\dots,M\), are mappings, and \(C_{i}\subset H_{1}\), \( i=1,\dots,N,\) and \(Q_{j}\subset H_{2}\) are nonempty, closed, and convex subsets, respectively. In this paper, which is inspired by [loc. cit.], the authors introduce an extension of the above problem to a multiple set split equilibrium problem and propose two parallel extragradient methods to solve it numerically. This is done in two steps. Firstly, they use the extragradient algorithm for solving equilibrium problems in the corresponding spaces to design the weak convergence algorithm. Secondly, they combine this algorithm with the hybrid cutting technique to get the strong convergence algorithm. The new algorithm is illustrated with a numerical example.