期刊文献+

GENERAL SPLIT FEASIBILITY PROBLEMS FOR TWO FAMILIES OF NONEXPANSIVE MAPPINGS IN HILBERT SPACES 被引量:1

GENERAL SPLIT FEASIBILITY PROBLEMS FOR TWO FAMILIES OF NONEXPANSIVE MAPPINGS IN HILBERT SPACES
下载PDF
导出
摘要 The purpose of this article is to introduce a general split feasibility problems for two families of nonexpansive mappings in Hilbert spaces. We prove that the sequence generated by the proposed new algorithm converges strongly to a solution of the general split feasibility problem. Our results extend and improve some recent known results. The purpose of this article is to introduce a general split feasibility problems for two families of nonexpansive mappings in Hilbert spaces. We prove that the sequence generated by the proposed new algorithm converges strongly to a solution of the general split feasibility problem. Our results extend and improve some recent known results.
出处 《Acta Mathematica Scientia》 SCIE CSCD 2016年第2期602-613,共12页 数学物理学报(B辑英文版)
基金 Supported by the Scientific Research Fund of Sichuan Provincial Department of Science and Technology(2015JY0165,2011JYZ011) the Scientific Research Fund of Sichuan Provincial Education Department(14ZA0271) the Scientific Research Project of Yibin University(2013YY06) the Natural Science Foundation of China Medical University,Taiwan the National Natural Science Foundation of China(11361070)
关键词 General split feasibility problems nonexpansive mappings Hilbert space strong convergence General split feasibility problems nonexpansive mappings Hilbert space strong convergence
  • 相关文献

参考文献22

  • 1Combettes P L. The convex feasibility problem in image recovery. Advances in Imaging and Electron Physics, 1996, 95:155-270.
  • 2Censor Y, Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numerical Algorithms, 1994, 8:221-239.
  • 3Byrne C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Problems, 2002, 18(2): 441-453.
  • 4Aleyner A, Reich S. Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces. Journal of Mathematical Analysis and Applications, 2008, 343(1): 427-435.
  • 5Bauschke H H, Borwein J M. On projection algorithms for solving convex feasibility problems. SIAM Review, 1996, 8(3): 367-426.
  • 6Moudaai A. A relaxed alternating CQ-algorithm for convex feasibility problems. Nonlinear Analysis, 2013, 79:117-121.
  • 7Masad E, Reich S. A note on the multiple-set split convex feasibility problem in Hilbert space. Journal of Nonlinear and Convex Analysis, 2007, 8:367-371.
  • 8Yao Y, Chen R, Marino G, et al. Applications of fixed point and optimization methods to the multiple-sets split feasibility problem. Journal of Applied Mathematics, 2012, 2012: Article ID 927530.
  • 9Yang Q. The relaxed CQ algorithm for solving the split feasibility problem. Inverse Problems, 2004, 20: 1261- 1266.
  • 10Zhao J, Yang Q. Several solution methods for the split feasibility problem. Inverse Problems, 2005, 21: 1791-1799.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部