A modified Mann iteration by boundary point method for finding minimum-norm fixed point of nonexpansive mappings (Q370200): Difference between revisions

Summary: Let \(H\) be a real Hilbert space and \(C \subset H\) a closed convex subset. Let \(T : C \to C\) be a nonexpansive mapping with the nonempty set of fixed points \(\text{Fix}(T)\). \textit{T.-H. Kim} and \textit{H.-K. Xu} [Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 61, No. 1--2, 51--60 (2005; Zbl 1091.47055)] introduced a modified Mann iteration \(x_0 = x \in C\), \(y_n = \alpha_nx_n + (1 - \alpha_n)Tx_n\), \(x_{n + 1} = \beta_nu + (1 - \beta_n)y_n\), where \(u \in C\) is an arbitrary (but fixed) element, and \(\{\alpha_n\}\) and \(\{\beta_n\}\) are two sequences in \((0, 1)\). In the case where \(0 \in C\), the minimum-norm fixed point of \(T\) can be obtained by taking \(u = 0\). But in the case where \(0 \ni C\), this iteration process becomes invalid because \(x_n\) may not belong to \(C\). In order to overcome this weakness, we introduce a new modified Mann iteration by boundary point method (see Section 3 for details) for finding the minimum norm fixed point of \(T\) and prove its strong convergence under some assumptions. Since our algorithm does not involve the computation of the metric projection \(P_C\), which is often used so that the strong convergence is guaranteed, it is easy implementable. Our results improve and extend the results of Kim and Xu [loc.\,cit.]\ and some others.