Volume 8, Number 3, December 2007, pp. 367-371
Eyal Masad and Simeon Reich

Key words:
Averaged mapping, convex feasibility problem, Hilbert space, iterative algorithm, nearest point projection, strongly nonexpansive mapping
Mathematices Subject Classification: Primary 47H09, 47N10, 90C25
ONLINE SUBSCRIPTION (Institutional Subscription Only)
Copyright© 2007 Yokohama Publishers
Back

Abstract:
We prove weak and strong convergence theorems for an algorithm that solves the multiple-set split convex feasibility problem in Hilbert space.
A note on the multiple-set split convex feasibility problem in Hilbert space