GENERAL SPLIT FEASIBILITY PROBLEMS FOR TWO FAMILIES OF NONEXPANSIVE MAPPINGS IN HILBERT SPACES
The purpose of this article is to introduce a general split feasibility problems for two families of nonexpansive mappings in Hilbert spaces. We prove that the sequence generated by the proposed new algorithm converges strongly to a solution of the general split feasibility problem. Our results exte...
Saved in:
Published in: | Acta mathematica scientia Vol. 36; no. 2; pp. 602 - 613 |
---|---|
Main Author: | |
Format: | Journal Article |
Language: | English |
Published: |
Elsevier Ltd
01-03-2016
Department of Mathematics, Yibin University, Yibin 644007, China%Center for General Education, China Medical University, Taichung 40402, Taiwan, China |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The purpose of this article is to introduce a general split feasibility problems for two families of nonexpansive mappings in Hilbert spaces. We prove that the sequence generated by the proposed new algorithm converges strongly to a solution of the general split feasibility problem. Our results extend and improve some recent known results. |
---|---|
Bibliography: | Jinfang TANG, Shih-sen CHANG, Min LIU(1. Department of Mathematics, Yibin University, Yibin 644007, China;2. Center for General Education, China Medical University, Taichung 40402, Taiwan, China;3. Department of Mathematics, Yibin University, Yibin 644007, China) 42-1227/O General split feasibility problems; nonexpansive mappings; Hilbert space;strong convergence The purpose of this article is to introduce a general split feasibility problems for two families of nonexpansive mappings in Hilbert spaces. We prove that the sequence generated by the proposed new algorithm converges strongly to a solution of the general split feasibility problem. Our results extend and improve some recent known results. ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0252-9602 1572-9087 |
DOI: | 10.1016/S0252-9602(16)30024-8 |