An iterative algorithm for the split equality and multiple-sets split equality problem
Summary: 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 \(A x = B y\), where \(N\) and \(M\) are positive integers, \(\{C_1, C_2, \ldots, C_N \}\) and \(\{Q_1, Q_2, \ldots, Q_M \}\) are closed convex subsets of Hilbert spaces \(H_1\), \(H_2\), respectively, and \(A : H_1 \rightarrow H_3\), \(B : H_2 \rightarrow 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.
scientific article; zbMATH DE number 7022741
scientific article