An Iterative Algorithm for the Split Equality and Multiple‐Sets Split Equality Problem

Luoyi Shi, Ru Dong Chen and Yu Jing Wu

Abstract and Applied Analysis, 2014, vol. 2014, issue 1

Abstract: The multiple‐sets split equality problem (MSSEP) requires finding a point x∈∩i=1NCi, y∈∩j=1MQj such that Ax = By, where N and M are positive integers, {C1, C2, …, CN} and {Q1, Q2, …, QM} are closed convex subsets of Hilbert spaces H1, H2, respectively, and A : H1 → H3, B : H2 → H3 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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/620813

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:620813

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().