ABSTRACT We introduce a new ergodic algorithm for solving equilibrium problems over the fixed point set of a nonexpansive mapping. In contrast to the existing one in Kim [The Bruck's… Click to show full abstract
ABSTRACT We introduce a new ergodic algorithm for solving equilibrium problems over the fixed point set of a nonexpansive mapping. In contrast to the existing one in Kim [The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set. Int. J. Comput. Math. 94 (2017), pp. 2466–2480], our algorithm uses self-adaptive step sizes. Thanks to that, the proposed algorithm converges under milder conditions. Moreover, at each step of our algorithm, instead of solving strongly convex problems, we only have to compute a subgradient of a convex function. Hence, our algorithm has lower computational cost.
               
Click one of the above tabs to view related content.