Iterative Methods for Fixed Point Problems in Hilbert Spaces

439 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Linear and strong convergence of algorithms involving averaged nonexpansive operators (2014, neutral): “, [6], [7], [12], [13], [14], [20], [21], [29], and the references therein.”
A strong convergence result involving an inertial forward–backward algorithm for monotone inclusions (2017, background): “Hence, the metric projection PCn has a closed-form expression and can be easily computed (see [19]).”
SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (2018, methodology): “However, with a suitable restriction on reflection parameters and under other modest assumptions, convergence may be guaranteed through Fejér monotonicity methods (see, for example, the works of Cegielski and Fukushima [59, 92]).”
Outer approximation methods for solving variational inequalities in Hilbert space (2017, background): “For a historical overview of the above-mentioned operators we refer the reader to [5].”
Compositions and convex combinations of averaged nonexpansive operators (2014, methodology): “By induction, it leads to the following result for the composition of m averaged operators, which was obtained in [8] (combine [8, Theorem 2.”
Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators (2013, neutral): “A. Cegielski (2012).”