## Abstract and Applied Analysis

### An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem

#### Abstract

The multiple-sets split equality problem (MSSEP) requires finding a point $x\in {\cap }_{i=1}^{N}{C}_{i}$, $y\in {\cap }_{j=1}^{M}{Q}_{j}$ such that $Ax=By$, where $N$ and $M$ are positive integers, $\{{C}_{1},{C}_{2},\dots ,{C}_{N}\}$ and $\{{Q}_{1},{Q}_{2},\dots ,{Q}_{M}\}$ are closed convex subsets of Hilbert spaces ${H}_{1}$, ${H}_{2}$, respectively, and $A:{H}_{1}\to {H}_{3}$, $B:{H}_{2}\to {H}_{3}$ are two bounded linear operators. When $N=M=1$, the MSSEP is called the split equality problem (SEP). If  $B=I$, then the MSSEP and SEP reduce to the well-known multiple-sets split feasibility problem (MSSFP) and split feasibility problem (SFP), respectively. One of the purposes of this paper is to introduce an iterative algorithm to solve the SEP and MSSEP in the framework of infinite-dimensional Hilbert spaces under some more mild conditions for the iterative coefficient.

#### Article information

Source
Abstr. Appl. Anal., Volume 2014, Special Issue (2014), Article ID 620813, 5 pages.

Dates
First available in Project Euclid: 2 October 2014

https://projecteuclid.org/euclid.aaa/1412278802

Digital Object Identifier
doi:10.1155/2014/620813

Mathematical Reviews number (MathSciNet)
MR3182296

Zentralblatt MATH identifier
1337.47103

#### Citation

Shi, Luoyi; Chen, Ru Dong; Wu, Yu Jing. An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem. Abstr. Appl. Anal. 2014, Special Issue (2014), Article ID 620813, 5 pages. doi:10.1155/2014/620813. https://projecteuclid.org/euclid.aaa/1412278802

#### References

• Y. Censor and T. Elfving, “A multiprojection algorithm using Bregman projections in a product space,” Numerical Algorithms, vol. 8, no. 2-4, pp. 221–239, 1994.
• Y. Censor, T. Elfving, N. Kopf, and T. Bortfeld, “The multiple-sets split feasibility problem and its applications for inverse problems,” Inverse Problems, vol. 21, no. 6, pp. 2071–2084, 2005.
• C. Byrne, “Iterative oblique projection onto convex sets and the split feasibility problem,” Inverse Problems, vol. 18, no. 2, pp. 441–453, 2002.
• C. Byrne, “A unified treatment of some iterative algorithms in signal processing and image reconstruction,” Inverse Problems, vol. 20, no. 1, pp. 103–120, 2004.
• B. Qu and N. Xiu, “A note on the CQ algorithm for the split feasibility problem,” Inverse Problems, vol. 21, no. 5, pp. 1655–1665, 2005.
• H.-K. Xu, “A variable Krasnosel'skii–-Mann algorithm and the multiple-set split feasibility problem,” Inverse Problems, vol. 22, no. 6, pp. 2021–2034, 2006.
• Q. Yang, “The relaxed CQ algorithm solving the split feasibility problem,” Inverse Problems, vol. 20, no. 4, pp. 1261–1266, 2004.
• Q. Yang and J. Zhao, “Generalized KM theorems and their applications,” Inverse Problems, vol. 22, no. 3, pp. 833–844, 2006.
• A. Moudafi, “A relaxed alternating CQ-algorithm for convex feasibility problems,” Nonlinear Analysis: Theory, Methods & Applications, vol. 79, pp. 117–121, 2013.
• L. Y. Shi, R. D. Chen, and Y. J. Wu, “Strong convergence of iterative algorithmsčommentComment on ref. [10?]: Please update the information of this reference, if possible. for the split equality problem,” Inverse Problems. In press.
• K. Goebel and W. A. Kirk, Topics in Metric Fixed Point Theory, vol. 28 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, UK, 1990.
• K. Geobel and S. Reich, Uniform Convexity, Nonexpansive Mappings, and Hyperbolic Geometry, Dekker, 1984.
• F. Schöpfer, T. Schuster, and A. K. Louis, “An iterative regularization method for the solution of the split feasibility problem in Banach spaces,” Inverse Problems, vol. 24, no. 5, pp. 055008–055027, 2008. \endinput