A combined method for smooth equilibrium problems with nonlinear constraints

Abstract

An iterative method for finding equilibrium points in the case of a smooth convex-concave function and a convex feasible set is proposed. This set is defined by smooth concave functions. The method is based on combining and extending ideas contained in feasible direction methods and relaxation methods for optimization problems and convex inequalities.