Iterative approximation to convex feasibility problems in Banach space

From MaRDI portal
Publication:2472281





In this paper, we consider the convex feasibility problem (CFP) of finding a point in the nonempty intersection \(\bigcap^N_{i=1}C_i\), where \(N\geq 1\) is an integer and each \(C_i\) is assumed to be the fixed point set of a nonexpansive mapping \(T_i:E\to E\), where \(E\) is a reflexive Banach space with a weakly sequentially continuous duality mapping. By using viscosity approximation methods for a finite family of nonexpansive mappings, it is shown that for any given contractive mapping \(f:C\to C\), where \(C\) is a nonempty closed convex subset of \(E\), and for any given \(x_0\in C\), the iterative scheme \(x_{n+1}=P[\alpha_{n+1}f(x_n)+(1-\alpha_{n+1})T_{n+1}x_n]\) is strongly convergent to a solution of the CFP, if and only if \(\{\alpha_n\}\) and \(\{x_n\}\) satisfy certain conditions, where \(\alpha_n\in(0,1)\), \(T_n=T_{n\pmod N}\) and \(P\) is a sunny nonexpansive retraction of \(E\) onto \(C\). The results presented in the paper extend and improve some results by Xu (2004), O'Hara et al.\ (2003), Song and Chen (2006), Bauschke (1996), Browder (1967), Halpern (1967), Jung (2005), Lions (1977), Moudafi (2000), Reich (1980), Wittmann (1992), and Reich (1994).



Cites work


Cited in
(22)








This page was built for publication: Iterative approximation to convex feasibility problems in Banach space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472281)