Alternating CQ-algorithms for convex feasibility and split fixed-point problems Page 1
Alternating CQ-algorithms for convex feasibility and split fixed-point problems A. Moudafi …

Let H1, H2, H3 be real Hilbert spaces, let U: H1→ H1 and T: H2→ H2 be two firmly
nonexpansive operators with non empty fixed-point sets F ixU=: C and F ixT=: Q, let A: H1→ …

Cyclic algorithms for split feasibility problems in Hilbert spaces - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

Let, and be real Hilbert spaces, let and be two bounded linear operators. Moudafi introduced
simultaneous iterative algorithms with weak convergence for the following split common …

The split feasibility problem (SFP) consists in finding a point in a given closed convex subset
of a Hilbert space such that its image under a bounded linear operator belongs to a given …

Let H1, H2, H3 be real Hilbert spaces, let C⊂ H1, Q⊂ H2 be two nonempty closed convex
level sets, let A: H1→ H3, B: H2→ H3 be two bounded linear operators. Our interest is in …

Based on recent works by Byrne-Censor-Gibali-Reich [C. Byrne, Y. Censor, A. Gibali and S.
Reich, The split common null point problem, J. Nonlinear Convex Anal. 13 (2012), 759-775] …

The split feasibility problem with multiple output sets in Hilbert spaces | SpringerLink Skip to
main content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search …

We introduce three new parallel algorithms for solving the split common fixed point problem
in Hilbert spaces. Those iterative methods for solving split common fixed point problems …

The split common fixed point problem (also called the multiple-sets split feasibility problem)
is to find a common fixed point of a finite family of operators in one real Hilbert space, whose …