Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings (Q312192): Difference between revisions

Three modified (hybrid) extragradient algorithms are proposed with convergence proofs for simultaneously solving a huge number of equilibrium problems and fixed point equations with nonexpansive operators in a given real Hilbert space. In the theory, the first two extragradient steps are replaced by the corresponding convex minimization problems which allows them to use more general assumptions (pseudomonotone bifunction). However, this can reduce the efficiency of the algorithms if the closed convex set \(C\) is very general. The given numeric example has \(2\times 10^6\) equilibrium problems over the real axis and \(3 \times 10^6\) fixed point equations also over the real axis. The very simple convex set is \(C=[0,1]\) and because of the simplicity of the example the extragradient steps can be explicitly executed. Hence the example is not representative for the used generality in the theory.