×

Split equality problem and multiple-sets split equality problem for quasi-nonexpansive multi-valued mappings. (English) Zbl 1337.47103

Summary: The multiple-sets split equality problem (MSSEP) requires finding a point \(x\in \cap^N_{i=1} C_i\), \(y\in \cap^M_{j=1}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 let \(B=I\), then the MSSEP and SEP reduce to the well-known multiple-sets split feasibility problem (MSSFP) and split feasibility problem (SFP), respectively. Recently, some authors proposed many algorithms to solve the SEP and MSSEP. However, to implement these algorithms, one has to find the projection on the closed convex sets, which is not possible except in simple cases. One of the purposes of this paper is to study the SEP and MSSEP for a family of quasi-nonexpansive multi-valued mappings in the framework of infinite-dimensional Hilbert spaces, and propose an algorithm to solve the SEP and MSSEP without the need to compute the projection on the closed convex sets.

MSC:

47J25 Iterative procedures involving nonlinear operators
47H04 Set-valued operators
47H09 Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc.
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Censor Y, Elfving T: A multiprojection algorithm using Bregman projections in a product space.Numer. Algorithms 1994, 8:221-239. · Zbl 0828.65065 · doi:10.1007/BF02142692
[2] Censor Y, Elfving T, Kopf N, Bortfeld T: The multiple-sets split feasibility problem and its applications for inverse problems.Inverse Probl. 2005, 21:2071-2084. · Zbl 1089.65046 · doi:10.1088/0266-5611/21/6/017
[3] Byrne C: Iterative oblique projection onto convex sets and the split feasibility problem.Inverse Probl. 2002,18(2):441-453. · Zbl 0996.65048 · doi:10.1088/0266-5611/18/2/310
[4] Byrne C: A unified treatment of some iterative algorithms in signal processing and image reconstruction.Inverse Probl. 2004,20(1):103-120. · Zbl 1051.65067 · doi:10.1088/0266-5611/20/1/006
[5] Qu B, Xiu N: A note on the CQ algorithm for the split feasibility problem.Inverse Probl. 2005,21(5):1655-1665. · Zbl 1080.65033 · doi:10.1088/0266-5611/21/5/009
[6] Xu HK: A variable Krasnoselskii-Mann algorithm and the multiple-set split feasibility problem.Inverse Probl. 2006,22(6):2021-2034. · Zbl 1126.47057 · doi:10.1088/0266-5611/22/6/007
[7] Yang Q: The relaxed CQ algorithm solving the split feasibility problem.Inverse Probl. 2004,20(4):1261-1266. · Zbl 1066.65047 · doi:10.1088/0266-5611/20/4/014
[8] Yang Q, Zhao J: Generalized KM theorems and their applications.Inverse Probl. 2006,22(3):833-844. · Zbl 1117.65081 · doi:10.1088/0266-5611/22/3/006
[9] Moudafi A: A relaxed alternating CQ-algorithms for convex feasibility problems.Nonlinear Anal., Theory Methods Appl. 2013, 79:117-121. · Zbl 1256.49044 · doi:10.1016/j.na.2012.11.013
[10] Shi, LY, Chen, RD, Wu, YJ: Strong convergence of iterative algorithms for the split equality problem. J. Inequal. Appl. (submitted) · Zbl 1089.65046
[11] Geobel, K.; Kirk, WA, Cambridge Studies in Advanced Mathematics 28 (1990), Cambridge · Zbl 0708.47031 · doi:10.1017/CBO9780511526152
[12] Geobel K, Reich S: Uniform Convexity, Nonexpansive Mappings, and Hyperbolic Geometry. Dekker, New York; 1984. · Zbl 0537.46001
[13] Schöpfer, F.; Schuster, T.; Louis, AK, An iterative regularization method for the solution of the split feasibility problem in Banach spaces, No. 24 (2008) · Zbl 1153.46308
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.