An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality ProblemReportar como inadecuado

An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract and Applied Analysis - Volume 2014 2014, Article ID 620813, 5 pages -

Research Article

Department of Mathematics, Tianjin Polytechnic University, Tianjin 300387, China

Tianjin Vocational Institute, Tianjin 300410, China

Received 11 December 2013; Revised 8 February 2014; Accepted 10 February 2014; Published 13 March 2014

Academic Editor: Yisheng Song

Copyright © 2014 Luoyi Shi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.

Autor: Luoyi Shi, Ru Dong Chen, and Yu Jing Wu



Documentos relacionados