Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces

Abstract

Abstract In this paper, we are concerned with the split equality problem (SEP) in Hilbert spaces. By converting it to a coupled fixed-point equation, we propose a new algorithm for solving the SEP. Whenever the convex sets involved are level sets of given convex functionals, we propose two new relaxed alternating algorithms for the SEP. The first relaxed algorithm is shown to be weakly convergent and the second strongly convergent. A new idea is introduced in order to prove strong convergence of the second relaxed algorithm, which gives an affirmative answer to Moudafi’s question. Finally, preliminary numerical results show the efficiency of the proposed algorithms.

Keywords

• Split feasibility problem
• Split equality problem
• Relaxed alternating method