Abstract and Applied Analysis
- Abstr. Appl. Anal.
- Volume 2014, Special Issue (2014), Article ID 620813, 5 pages.
An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem
The multiple-sets split equality problem (MSSEP) requires finding a point , such that , where and are positive integers, and are closed convex subsets of Hilbert spaces , , respectively, and , are two bounded linear operators. When , the MSSEP is called the split equality problem (SEP). If , 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.
Abstr. Appl. Anal., Volume 2014, Special Issue (2014), Article ID 620813, 5 pages.
First available in Project Euclid: 2 October 2014
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
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