Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2012 (2012), Article ID 949141, 15 pages
Research Article

Iterative Algorithms Approach to Variational Inequalities and Fixed Point Problems

1Department of Information Management, Cheng Shiu University, Kaohsiung 833, Taiwan
2Department of Mathematics, Tianjin Polytechnic University, Tianjin 300387, China

Received 21 September 2011; Revised 16 November 2011; Accepted 17 November 2011

Academic Editor: Khalida Inayat Noor

Copyright © 2012 Yeong-Cheng Liou et al. 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.


We consider a general variational inequality and fixed point problem, which is to find a point x* with the property that (GVF): x*GVI(C,A) and g(x*)Fix(S) where GVI(C,A) is the solution set of some variational inequality Fix(S) is the fixed points set of nonexpansive mapping S, and g is a nonlinear operator. Assume the solution set Ω of (GVF) is nonempty. For solving (GVF), we suggest the following method g(xn+1)=βg(xn)+(1-β)SPC[αnF(xn)+(1-αn)(g(xn)-λAxn)], n0. It is shown that the sequence {xn} converges strongly to x*Ω which is the unique solution of the variational inequality F(x*)-g(x*),g(x)-g(x*)0, for all xΩ.