Volume 2013, Issue 1 768595
Research Article
Open Access

A Modified Mann Iteration by Boundary Point Method for Finding Minimum-Norm Fixed Point of Nonexpansive Mappings

Songnian He

Corresponding Author

Songnian He

College of Science, Civil Aviation University of China, Tianjin 300300, China cauc.edu.cn

Tianjin Key Laboratory for Advanced Signal Processing, Civil Aviation University of China, Tianjin 300300, China cauc.edu.cn

Search for more papers by this author
Wenlong Zhu

Wenlong Zhu

College of Science, Civil Aviation University of China, Tianjin 300300, China cauc.edu.cn

Tianjin Key Laboratory for Advanced Signal Processing, Civil Aviation University of China, Tianjin 300300, China cauc.edu.cn

Search for more papers by this author
First published: 27 March 2013
Citations: 5
Academic Editor: Satit Saejung

Abstract

Let H be a real Hilbert space and CH a closed convex subset. Let T : CC be a nonexpansive mapping with the nonempty set of fixed points Fix(T). Kim and Xu (2005) introduced a modified Mann iteration x0 = xC, yn = αnxn + (1 − αn)Txn, xn+1 = βnu + (1 − βn)yn, where uC is an arbitrary (but fixed) element, and {αn} and {βn} are two sequences in (0, 1). In the case where 0 ∈ C, the minimum-norm fixed point of T can be obtained by taking u = 0. But in the case where 0 ∉ C, this iteration process becomes invalid because xn 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 PC, which is often used so that the strong convergence is guaranteed, it is easy implementable. Our results improve and extend the results of Kim, Xu, and some others.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.