A modified Mann iteration by boundary point method for finding minimum-norm fixed point of nonexpansive mappings (Q370200): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 47J25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 47H09 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6209437 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
modified Mann iteration | |||
Property / zbMATH Keywords: modified Mann iteration / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
strong convergence | |||
Property / zbMATH Keywords: strong convergence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
boundary point method | |||
Property / zbMATH Keywords: boundary point method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimum-norm fixed point | |||
Property / zbMATH Keywords: minimum-norm fixed point / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonexpansive maps | |||
Property / zbMATH Keywords: nonexpansive maps / rank | |||
Normal rank |
Revision as of 13:37, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A modified Mann iteration by boundary point method for finding minimum-norm fixed point of nonexpansive mappings |
scientific article |
Statements
A modified Mann iteration by boundary point method for finding minimum-norm fixed point of nonexpansive mappings (English)
0 references
19 September 2013
0 references
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.
0 references
modified Mann iteration
0 references
strong convergence
0 references
boundary point method
0 references
minimum-norm fixed point
0 references
nonexpansive maps
0 references