Convergence analysis of new construction explicit methods for solving equilibrium programming and fixed point problems (Q2158407)

Summary: In this paper, we present improved iterative methods for evaluating the numerical solution of an equilibrium problem in a Hilbert space with a pseudomonotone and a Lipschitz-type bifunction. The method is built around two computing phases of a proximal-like mapping with inertial terms. Many such simpler step size rules that do not involve line search are examined, allowing the technique to be enforced more effectively without knowledge of the Lipschitz-type constant of the cost bifunction. When the control parameter conditions are properly defined, the iterative sequences converge weakly on a particular solution to the problem. We provide weak convergence theorems without knowing the Lipschitz-type bifunction constants. A few numerical tests were performed, and the results demonstrated the appropriateness and rapid convergence of the new methods over traditional ones.