General Iterative Algorithms for Hierarchical Fixed Points Approach to Variational Inequalities
This paper deals with new methods for approximating a solution to the fixed point problem; find x̃∈F(T), where H is a Hilbert space, C is a closed convex subset of H, f is a ρ-contraction from C into H, 0<ρ<1, A is a strongly positive linear-bounded operator with coefficient γ̅>0, 0<γ<...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2012/174318 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper deals with new methods for approximating a solution to the fixed point problem; find x̃∈F(T), where H is a Hilbert space, C is a closed convex subset of H, f is a ρ-contraction from C into H, 0<ρ<1, A is a strongly positive linear-bounded operator with coefficient γ̅>0, 0<γ<γ̅/ρ, T is a nonexpansive mapping on C, and PF(T) denotes the metric projection on the set of fixed point of T. Under a suitable different parameter, we obtain strong convergence theorems by using the projection method which solves the variational inequality 〈(A-γf)x̃+τ(I-S)x̃,x-x̃〉≥0 for x∈F(T), where τ∈[0,∞). Our results generalize and improve the corresponding results of Yao et al. (2010) and some authors. Furthermore, we give an example which supports our main theorem in the last part. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |