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→ …

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 …

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 purpose of this paper is to introduce and analyze an extragradient method with
regularization for finding a common element of the solution set Γ of the split feasibility …

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 …

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 …

A variable Krasnosel'skii–Mann algorithm generates a sequence {xn} via the formula x n+
1=(1− α n) x n+ α n T nxn, where {α n} is a sequence in [0, 1] and {T n} is a sequence of …

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 …

In this paper, we consider the split feasibility problem (SFP) in infinite-dimensional Hilbert
spaces, and study the relaxed extragradient methods for finding a common element of the …

Our contribution in this paper is to propose an iterative algorithm which does not require
prior knowledge of operator norm and prove strong convergence theorem for approximating …