We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact us so we can address the problem.
Krasnoselskii-Mann method for non-self mappings
- Vittorio Colao^{1} and
- Giuseppe Marino^{1, 2}Email author
https://doi.org/10.1186/s13663-015-0287-4
© Colao and Marino; licensee Springer. 2015
- Received: 4 December 2014
- Accepted: 3 March 2015
- Published: 13 March 2015
Abstract
Let H be a Hilbert space and let C be a closed, convex and nonempty subset of H. If \(T:C\to H\) is a non-self and non-expansive mapping, we can define a map \(h:C\to\mathbb{R}\) by \(h(x):=\inf\{\lambda\geq 0:\lambda x+(1-\lambda)Tx\in C\}\). Then, for a fixed \(x_{0}\in C\) and for \(\alpha_{0}:=\max\{1/2, h(x_{0})\}\), we define the Krasnoselskii-Mann algorithm \(x_{n+1}=\alpha _{n}x_{n}+(1-\alpha_{n})Tx_{n}\), where \(\alpha_{n+1}=\max\{\alpha_{n},h(x_{n+1})\}\). We will prove both weak and strong convergence results when C is a strictly convex set and T is an inward mapping.
Keywords
- Hilbert Space
- Convergence Result
- Resource Consumption
- Nonempty Subset
- Real World Application
1 Introduction
Let C be a closed, convex and nonempty subset of a Hilbert space H and let \(T:C\to H\) be a non-expansive mapping such that the fixed point set \(\operatorname{Fix}(T):=\{x\in C:Tx=x\}\) is not empty.
- (C1)
T is a self-mapping, i.e., \(T:C\to C\) and
- (C2)
\(\{\alpha_{n}\}\) is such that \(\sum_{n}\alpha _{n}(1-\alpha_{n})=+\infty\).
Historically, the inward condition and its generalizations were widely used to prove convergence results for both implicit [8–11] and explicit (see, e.g., [1, 12–14]) algorithms. However, we point out that the explicit case was only studied in conjunction with processes involving the calculation of a projection or a retraction \(P:H\to C\) at each step.
We point out that in many real world applications, the process of calculating P can be a resource consumption task and it may require an approximating algorithm by itself, even in the case when P is the nearest point projection.
We stress that the main difference between the classical Krasnoselskii-Mann and our algorithm is that the choice of the coefficient \(\alpha_{n}\) is not made a priori in the latter, but it is constructed step to step and determined by the values of the map T and the geometry of the set C.
2 Main result
We will make use of the following.
Definition 1
We refer to [15] for a comprehensive survey on the properties of the inward mappings.
Definition 2
Definition 3
Lemma 1
- (P1)
for any \(x\in C\), \(h(x)\in[0,1]\) and \(h(x)=0\) if and only if \(Tx\in C\);
- (P2)
for any \(x\in C\) and any \(\alpha\in[h(x),1]\), \(\alpha x+(1-\alpha)Tx\in C\);
- (P3)
if T is an inward mapping, then \(h(x)<1\) for any \(x\in C\);
- (P4)
whenever \(Tx\notin C\), \(h(x)x+(1-h(x))Tx\in\partial C\).
Proof
Our main result is the following.
Theorem 1
- 1.
C is strictly convex and
- 2.
T is a non-expansive mapping, which satisfies the inward condition (2) and such that \(\operatorname{Fix}(T)\neq\emptyset\),
Proof
Remark 1
Following the same line of proof, it can be easily seen that the same results hold true if the starting coefficient \(\alpha_{0}=\max\{ \frac{1}{2},h(x_{0})\}\) is substituted by \(\alpha_{0}=\max\{b,h(x_{0})\}\), where \(b\in(0,1)\) is a fixed and arbitrary value. In the statement of Theorem 1, the value \(b=\frac{1}{2}\) was taken to ease the notation.
We also note that the value \(h(x_{n})\) can be replaced, in practice, by \(h_{n}=1-\frac{1}{2^{j_{n}}}\), where \(j_{n}:=\min\{j\in\mathbb {N}:(1-\frac{1}{2^{j}})x_{n}+\frac{1}{2^{j}}Tx_{n}\in C\}\).
Remark 2
As it follows from the proof, the condition \(\sum_{n}(1-\alpha _{n})<\infty\) provides a localization result for the fixed point \(x^{*}\) as a side result. Indeed, in this case, it holds that \(x^{*}=v_{1}=v_{2}\) belongs to the boundary ∂C of the set C.
Remark 3
We illustrate the statement of our results with a brief example.
Example 1
We conclude the paper by including few question that appear to be still open to the best of our knowledge.
Question 1
It has been proved that the Krasnoselskii-Mann algorithm converges for general classes of mappings (see, e.g., [20] and [21]). By maintaining the same assumption on the set C and the inward condition of the involved map, it appears to be natural to ask for which classes of mappings the same result of Theorem 1 still holds.
Question 2
We refer to [22] and [23] for two examples regarding the classical Krasnoselskii-Mann algorithm.
Question 3
On the other hand, we observe that the strict convexity of the set C does appear to be unusual for results regarding the convergence of Krasnoselskii-Mann iterations. We do not know if our result can hold for a convex and closed set C, even at the price of strengthening the requirements on the map T.
Declarations
Acknowledgements
This project was funded by Ministero dell’Istruzione, dell’Universitá e della Ricerca (MIUR).
Open Access This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.
Authors’ Affiliations
References
- Chidume, C: Geometric Properties of Banach Spaces and Nonlinear Iterations. Lecture Notes in Mathematics, vol. 1965. Springer, Berlin (2009) MATHGoogle Scholar
- Mann, WR: Mean value methods in iteration. Proc. Am. Math. Soc. 4(3), 506-510 (1953) View ArticleMATHMathSciNetGoogle Scholar
- Groetsch, CW: A note on segmenting Mann iterates. J. Math. Anal. Appl. 40(2), 369-372 (1972) View ArticleMATHMathSciNetGoogle Scholar
- Hicks, TL, Kubicek, JD: On the Mann iteration process in a Hilbert space. J. Math. Anal. Appl. 59(3), 498-504 (1977) View ArticleMATHMathSciNetGoogle Scholar
- Edelstein, M, O’Brien, RC: Nonexpansive mappings, asymptotic regularity and successive approximations. J. Lond. Math. Soc. 2(3), 547-554 (1978) View ArticleMathSciNetMATHGoogle Scholar
- Hillam, BP: A generalization of Krasnoselski’s theorem on the real line. Math. Mag. 48(3), 167-168 (1975) View ArticleMATHMathSciNetGoogle Scholar
- Reich, S: Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 67(2), 274-276 (1979) View ArticleMATHMathSciNetGoogle Scholar
- Xu, H-K, Yin, X-M: Strong convergence theorems for nonexpansive nonself-mappings. Nonlinear Anal. 24(2), 223-228 (1995) View ArticleMATHMathSciNetGoogle Scholar
- Xu, H-K: Approximating curves of nonexpansive nonself-mappings in Banach spaces. C. R. Acad. Sci. Paris Sér. I Math. 325(2), 151-156 (1997) View ArticleMATHMathSciNetGoogle Scholar
- Marino, G, Trombetta, G: On approximating fixed points for nonexpansive mappings. Indian J. Math. 34, 91-98 (1992) MATHMathSciNetGoogle Scholar
- Takahashi, W, Kim, G-E: Strong convergence of approximants to fixed points of nonexpansive nonself-mappings in Banach spaces. Nonlinear Anal. 32(3), 447-454 (1998) View ArticleMATHMathSciNetGoogle Scholar
- Song, Y, Chen, R: Viscosity approximation methods for nonexpansive nonself-mappings. J. Math. Anal. Appl. 321(1), 316-326 (2006) View ArticleMATHMathSciNetGoogle Scholar
- Song, YS, Cho, YJ: Averaged iterates for non-expansive nonself mappings in Banach spaces. J. Comput. Anal. Appl. 11, 451-460 (2009) MATHMathSciNetGoogle Scholar
- Zhou, H, Wang, P: Viscosity approximation methods for nonexpansive nonself-mappings without boundary conditions. Fixed Point Theory Appl. 2014, 61 (2014) View ArticleMathSciNetGoogle Scholar
- Kirk, W, Sims, B: Handbook of Metric Fixed Point Theory. Springer, Berlin (2001) View ArticleMATHGoogle Scholar
- Ishikawa, S: Fixed points and iteration of a nonexpansive mapping in a Banach space. Proc. Am. Math. Soc. 59(1), 65-71 (1976) View ArticleMATHMathSciNetGoogle Scholar
- Bauschke, HH, Combettes, PL: A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Math. Oper. Res. 26(2), 248-264 (2001) View ArticleMATHMathSciNetGoogle Scholar
- He, S, Zhu, W: A modified Mann iteration by boundary point method for finding minimum-norm fixed point of nonexpansive mappings. Abstr. Appl. Anal. 2013, Article ID 768595 (2013) MathSciNetMATHGoogle Scholar
- He, S, Yang, C: Boundary point algorithms for minimum norm fixed points of nonexpansive mappings. Fixed Point Theory Appl. 2014, 56 (2014) View ArticleMathSciNetGoogle Scholar
- Schu, J: Iterative construction of fixed points of asymptotically nonexpansive mappings. J. Math. Anal. Appl. 158(2), 407-413 (1991) View ArticleMATHMathSciNetGoogle Scholar
- Marino, G, Xu, H-K: Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J. Math. Anal. Appl. 329(1), 336-346 (2007) View ArticleMATHMathSciNetGoogle Scholar
- Bauschke, HH: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space. J. Math. Anal. Appl. 202(1), 150-159 (1996) View ArticleMATHMathSciNetGoogle Scholar
- Suzuki, T: Strong convergence of Krasnoselskii and Mann’s type sequences for one-parameter nonexpansive semigroups without Bochner integrals. J. Math. Anal. Appl. 305(1), 227-239 (2005) View ArticleMATHMathSciNetGoogle Scholar