A parallel combination extragradient method with Armijo line searching for finding common solutions of finite families of equilibrium and fixed point problems

In this paper, we introduce a new parallel combination extragradient method for solving a finite family of pseudo-monotone equilibrium problems and finding a common fixed point of a finite family of demicontractive mappings in Hilbert space. The algorithm is designed such that at each iteration a single strongly convex program is solved and the stepsize is determined via an Armijo line searching technique. Also, the algorithm make a single projection onto a sub-level set which is constructed by the convex combination of finite convex functions. Under certain mild-conditions, we state and prove a strong convergence theorem for approximating a common solution of a finite family of equilibrium problems with pseudo-monotone bifunctions and a finite family of demicontractive mappings. Finally, we present numerical examples to illustrate the applicability of the algorithm proposed. This method improves many of the existing methods in the literature.