The Strongly Convergent Relaxed Alternating CQ Algorithms for the Split Equality Problem in Hilbert Spaces

Viscosity approximation of a relaxed alternating CQ algorithm for the split equality problem

“…Definition 2.2. [7] Assume that f : H → (−∞, +∞] is a proper function and λ ∈ (0, 1). and nonempty subset of H. Then C is a Chebyshev set, for every x and p in H, p = P C x ⇔ p ∈ C and (∀y ∈ C) x − p, y − p ≤ 0.…”

“…Recently, Gao and Liu [7] studied the following relaxed alternating CQ algorithm for solving the SEP (1.1):…”

Alternated inertial simultaneous and semi-alternating projection algorithms for solving the split equality problem

“…A number of literatures on algorithms for solving SEP have been published (see [6,10,[17][18][19]). For example, in [16], inspired by iterative algorithms for solving a variational inequality, Tian et al proposed several two-step methods and relaxed two-step methods.…”