Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings

From MaRDI portal



Abstract: In this paper we propose and analyze three parallel hybrid extragradient methods for finding a common element of the set of solutions of equilibrium problems involving pseudomonotone bifunctions and the set of fixed points of nonexpansive mappings in a real Hilbert space. Based on parallel computation we can reduce the overall computational effort under widely used conditions on the bifunctions and the nonexpansive mappings.A simple numerical example is given to illustrate the proposed parallel algorithms.


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.



Cites work


Cited in
(96)








This page was built for publication: Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312192)