On a two-step algorithm for hierarchical fixed point problems and variational inequalities (Q1035471): Difference between revisions

The paper is concerned with the variational inequality problem of finding \(x^* \in \text{Fix}(T)\) with \(\langle (I-S)x^*, x-x^* \rangle \geq 0\) for all \(x\in \text{Fix}(T)\), where \(T,S: C\to C\) are nonexpansive mappings such that Fix\((T)\), the set of fixed points set of \(T\), is nonempty, and \(C\) is a closed convex subset of a Hilbert space \(H\). Let \(f: C \to C\) be a contraction. The authors study convergence properties of the iterative process \(x_{n+1}=\alpha_n f(x_n)+(1-\alpha_n) T y_n\), \(y_n=\beta_n S x_n+(1-\beta_n) x_n\), where \(\alpha_n,\beta_n \in [0,1]\).