Iterative selection methods for common fixed point problems
By Sever A. Hirstoaga. 2006
72 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/420c3b4f5768ee8d2d933517ba122ec7b829208f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Aviv Gibali
- Simeon Reich
- Rafał Zalas
- Andrzej Cegielski
- Yekini Shehu
- Duong Viet Thong
- Dang Van Hieu
- Oluwatosin Temitope Mewomo
In Geometry and Topology
- Aviv Gibali
- Simeon Reich
- Rafał Zalas
- Andrzej Cegielski
- Patrick L. Combettes
- Isao Yamada
- Brailey Sims
- Scott B. Lindstrom
In Numerical Analysis
- Aviv Gibali
- Simeon Reich
- Rafał Zalas
- Andrzej Cegielski
- Yekini Shehu
- Duong Viet Thong
- Dang Van Hieu
- Oluwatosin Temitope Mewomo
Citations in the corpus
- Outer approximation methods for solving variational inequalities in Hilbert space (2017, methodology): “This condition is quite common in optimization theory and, in particular, appears in the context of the HSD method (19); see, for example, the papers by Yamada and Ogura [23], Hirstoaga [24], Aoyama and Kohsaka [30], Cegielski and Zalas [7,29] and Cegielski and Al-Musallam [34].”
- Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators (2013, methodology): “A more general model than the GHSD method was proposed by Hirstoaga in [20].”