On solving pseudomonotone equilibrium problems via two new extragradient-type methods under convex constraints

Abstract

The primary objective of this study is to develop two new proximal-type algorithms for solving equilibrium problems in real Hilbert space. Both new algorithms are analogous to the well-known two-step extragradient algorithm for solving the variational inequality problem in Hilbert spaces. The proposed iterative algorithms use a new step size rule based on local bifunction information instead of the line search technique. Two weak convergence theorems for both algorithms are well-established by letting mild conditions. The main results are used to solve the fixed point and variational inequality problems. Finally, we present several computational experiments to demonstrate the efficiency and effectiveness of the proposed algorithms.

Keywords

• equilibrium problem
• lipschitz-type continuous
• weak convergence theorem
• pseudomonotone bifunction
• proximal algorithm
• 47h06
• 47h09
• 47j05
• 47j25