首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
Authors:Arkady Aleyner
Institution:Department of Mathematics, The Technion - Israel Institute of Technology, 32000 Haifa, Israel
Abstract:We establish convergence theorems for two different block-iterative methods for solving the problem of finding a point in the intersection of the fixed point sets of a finite number of nonexpansive mappings in Hilbert and in finite-dimensional Banach spaces, respectively.
Keywords:Block-iterative algorithmic scheme  Common fixed point  Nonexpansive mapping  Relaxation method
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号