Outer approximation algorithms for pseudomonotone equilibrium problems
We propose a new method for solving equilibrium problems on a convex subset C C , where the underlying function is continuous and pseudomonotone which is called an outer approximation algorithm . The algorithm is to define new approximating subproblems on the convex domains Ck?C,k=0,1, C k ? C , k = 0 , 1 ,  , which forms a generalized iteration scheme for finding a global equilibrium point. Finally we present some numerical experiments to illustrate the behavior of the proposed algorithms.
pseudomonotonicity equilibrium problems global equilibrium point proximal point-type algorithm