2010
DOI: 10.1016/j.nahs.2010.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid algorithm for fixed points of weak relatively nonexpansive mappings and applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
8
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 24 publications
(9 citation statements)
references
References 17 publications
1
8
0
Order By: Relevance
“…Our iteration scheme seems simpler and better than those studied in [31,24,8,16]. Our theorems improve and generalize the results of Chang et al [8], Kang, et al [16], Takahashi and Zambayeshi [24], Zegeye [31] and those of host of other authors. Application of our theorem to iterative approximation of solution of equation of Hammerstein-type is of independent interest.…”
Section: Remarksupporting
confidence: 84%
See 3 more Smart Citations
“…Our iteration scheme seems simpler and better than those studied in [31,24,8,16]. Our theorems improve and generalize the results of Chang et al [8], Kang, et al [16], Takahashi and Zambayeshi [24], Zegeye [31] and those of host of other authors. Application of our theorem to iterative approximation of solution of equation of Hammerstein-type is of independent interest.…”
Section: Remarksupporting
confidence: 84%
“…It is easy to see that the iteration process studied in this paper seems simpler than the schemes studied by [8,16,24,31]. Moreover, Theorem 13 generalizes the corresponding results of Chang et al [8], Kang, et al [16], Takahashi and Zambayeshi [24], Zegeye [31] and those of host of other authors to approximation of common element of null spaces of finite family of c inverse strongly monotone mappings, set of common fixed point of finite family of weak relatively nonexpansive mappings and solution set of generalized mixed equilibrium problem.…”
Section: Remark 19mentioning
confidence: 94%
See 2 more Smart Citations
“…x 0 ∈ C, y n = J −1 (α n Jx n + (1 − α n )JT x n ), C n = {v ∈ C : φ (v, y n ) ≤ φ (v, x n )} , Q n = {v ∈ C : Jx 0 − Jx n , x n − v ≥ 0} , x n+1 = Π C n Q n x 0 , n ≥ 0. This algorithm has been modified and generalized for finding a common fixed point of a finite or infinite family of relatively nonexpansive mappings by several authors, such as Takahashi et al [29], Takahashi and Zembayashi [30], Wang and Xuan [32], Reich and Sabach [24,25], Kang, Su, and Zhang [13], Plubtieng and Ungchittrakool [22], etc... In 2011, Liu [20] introduced the following cyclic method for a finite family of relatively nonexpansive mappings:…”
Section: Introductionmentioning
confidence: 99%