|
General Iterative Algorithms for Hierarchical Fixed Points Approach to Variational InequalitiesDOI: 10.1155/2012/174318 Abstract: This paper deals with new methods for approximating a solution to the fixed point problem; find ?∈(), where is a Hilbert space, is a closed convex subset of , is a -contraction from into , 0<<1, is a strongly positive linear-bounded operator with coefficient >0, 0<, is a nonexpansive mapping on , and () denotes the metric projection on the set of fixed point of . Under a suitable different parameter, we obtain strong convergence theorems by using the projection method which solves the variational inequality ?(?)?
|