An iterative process for solving the constrained convex optimization problem via fixed point methods

Abstract

In this paper, we introduce the iterative scheme for finding a common element of the set of fixed pointsand the set of equilibrium problems for nonexpansive mappings. We provide algorithm which strong convergence theorems are obtained in Hilbert spaces. Then, we apply these algorithm to solve some convex optimization problems. The results of this paper extend and improve several results presented in the literature in the recent past. © 2014 Springer Science+Business Media Dordrecht.