{'fraction_non_alphanumeric': 0.02956298200514139, 'fraction_numerical': 0.016709511568123392, 'mean_word_length': 5.0859375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The subgradient extragradient method extended to equilibrium problems

A globally convergent algorithm for equilibrium problems with pseudomonotone bifunctions is proposed. The algorithm is based on the idea of the subgradient extragradient method for solving variational inequalities proposed by Censor et al. [Y. Censor, A. Gibali, and S. Reich, The subgradient extragradient method for solving variational inequalities in Hilbert space, J. Optim. Theory Appl. 148 (2011), 318–335.] and Armijo linesearch techniques. In addition, we give a modified version of our algorithm for finding a common point of the solution set of equilibrium problems and the fixed point set of a nonexpansive mapping. We also analyse the weak convergence of both algorithms in a real Hilbert space.