Iterative algorithms for minimum-norm fixed point of non-expansive mapping in hilbert space

Fixexd point theory and applications

Yuchao Tang¹  Yong Cai¹  Liwei Liu² 

[1] Department of Mathematics, Nanchang University, Nanchang, China;Department of Mathematics, Xi'an Jiaotong University, Xi'an, China

关键词: nonexpansive mapping;    minimum-norm;    fixed point;    convex optimization;   

DOI  :  10.1186/1687-1812-2012-49

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

The purpose of this article is to introduce two iterative algorithms for finding the least norm fixed point of nonexpansive mappings. We provide two algorithms, one implicit and another explicit, from which strong convergence theorems are obtained in Hilbert spaces. Then we apply these algorithms to solve some convex optimization problems. Furthermore, we use them to solve some split feasibility problems. The results of this article extend and improve several results presented in the literature in the recent past. Mathematics Subject Classification (2000): 47H09; 47H10; 90C25.

【 授权许可】

CC BY