Extragradient algorithms for split equilibrium problem and nonexpansive mapping
Abstract
In this paper, we propose new extragradient algorithms for solving a split equilibrium and nonexpansive mapping SEPNM(C, Q, A, f, g, S, T) where C, Q are nonempty closed convex subsets in real Hilbert spaces H1, H2 respectively, A : H1 H2 is a bounded linear operator, f is a pseudomonotone bifunction on C and g is a monotone bifunction on Q, S, T are nonexpansive mappings on C and Q respectively. By using extragradient method combining with cutting techniques, we obtain algorithms for the problem. Under certain conditions on parameters, the iteration sequences generated by the algorithms are proved to be weakly and strongly convergent to a solution of this problem.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.