Copyright © 2010 Yonghong Yao and Yeong-Cheng Liou. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The purpose of this paper is to solve the minimization problem of finding such that , where stands for the intersection set of the solution set of the equilibrium problem and the fixed points set of a nonexpansive mapping. We first present two new composite algorithms (one implicit and one explicit). Further, we prove that the proposed composite algorithms converge strongly to .