composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems复合算法最小化在平衡问题的解决方法和不动点问题.pdfVIP

Hindawi Publishing Corporation Abstract and Applied Analysis Volume 2010, Article ID 763506, 19 pages doi:10.1155/2010/763506 Research Article Composite Algorithms for Minimization over the Solutions of Equilibrium Problems and Fixed Point Problems Yonghong Yao1 and Yeong-Cheng Liou2 1 Department of Mathematics, Tianjin Polytechnic University, Tianjin 300160, China 2 Department of Information Management, Cheng Shiu University, Kaohsiung 833, Taiwan Correspondence should be addressed to Yonghong Yao, yaoyonghong@ Received 7 July 2010; Accepted 27 September 2010 Academic Editor: Chaitan Gupta Copyright q 2010 Y. Yao and Y.-C. 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 x∗ such that x∗ 2 arg minx∈Γ x , 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 x . 1. Introduction In the present paper, our main purpose is to solve the minimization problem of finding x∗ such that ∗ 2 x arg min x , 1.1 x∈Γ where Γ stands for the intersection set of the solution set of the equilibrium problem an