Acta mathematica scientia, Series B >
GENERAL SPLIT FEASIBILITY PROBLEMS FOR TWO FAMILIES OF NONEXPANSIVE MAPPINGS IN HILBERT SPACES
Received date: 2014-12-15
Revised date: 2015-07-11
Online published: 2016-04-25
Supported by
Supported by the Scientific Research Fund of Sichuan Provincial Department of Science and Technology (2015JY0165, 2011JYZ011), the Scientific Research Fund of Sichuan Provincial Education Department (14ZA0271), the Scientific Research Project of Yibin University (2013YY06), the Natural Science Foundation of China Medical University, Taiwan, and the National Natural Science Foundation of China (11361070).
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.
Jinfang TANG , Shih-sen CHANG , Min LIU . GENERAL SPLIT FEASIBILITY PROBLEMS FOR TWO FAMILIES OF NONEXPANSIVE MAPPINGS IN HILBERT SPACES[J]. Acta mathematica scientia, Series B, 2016 , 36(2) : 602 -613 . DOI: 10.1016/S0252-9602(16)30024-8
[1] Combettes P L. The convex feasibility problem in image recovery. Advances in Imaging and Electron Physics, 1996, 95:155-270
[2] Censor Y, Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numerical Algorithms, 1994, 8:221-239
[3] Byrne C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Problems, 2002, 18(2):441-453
[4] Aleyner A, Reich S. Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces. Journal of Mathematical Analysis and Applications, 2008, 343(1):427-435
[5] Bauschke H H, Borwein J M. On projection algorithms for solving convex feasibility problems. SIAM Review, 1996, 8(3):367-426
[6] Moudafi A. A relaxed alternating CQ-algorithm for convex feasibility problems. Nonlinear Analysis, 2013, 79:117-121
[7] Masad E, Reich S. A note on the multiple-set split convex feasibility problem in Hilbert space. Journal of Nonlinear and Convex Analysis, 2007, 8:367-371
[8] Yao Y, Chen R, Marino G, et al. Applications of fixed point and optimization methods to the multiple-sets split feasibility problem. Journal of Applied Mathematics, 2012, 2012:Article ID 927530
[9] Yang Q. The relaxed CQ algorithm for solving the split feasibility problem. Inverse Problems, 2004, 20:1261-1266
[10] Zhao J, Yang Q. Several solution methods for the split feasibility problem. Inverse Problems, 2005, 21:1791-1799
[11] Quan J, Chang S.S, Zhang X. Multiple-set split feasibility problems for κ-strictly pseudononspreading mappings in Hilbert spaces. Abstract and applied analysis, 2013. article ID 342545
[12] Xu H K. A variable Krasnosel'skii-Mann algorithm and the multiple-set split feasibility problem. Inverse Problems, 2006, 22:2021-2034
[13] Xu H K. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Problems, 2010, 26:Article ID 105018
[14] Wang F, Xu H K. Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Analysis:Theory, Methods and Applications, 2011, 74(12):4105-4111
[15] Eslamian M, Latif A. General split feasibility problems in Hilbert spaces. Abstract and Applied Analysis Volume 2013. Article ID 805104
[16] He S, Zhao Z. Strong Convergence of A Relaxed CQ Algorithm for the Split Feasibility Problem. Journal of Inequalities and Applications, 2013. doi:10.1186/1029-242X-2013-197
[17] Tang J F, Chang S S, Yuan F. A strong convergence theorem for equilibrium problems and split feasibility problems in Hilbert spaces. Fixed point theory and applications, 2014, 2014:36
[18] Chang S S. On Chidume's open questions and approximate solutions for multi-valued strongly accretive mapping equations in Banach spaces. J. Math. Anal. Applications, 1997,216:94-111
[19] Chang S S, Kim J K, Wang X R, Modified block iterative algorithm for solving convex feasibility problems in Banach spaces. Journal of Inequalities and Applications, 2010. Article ID869684
[20] Xu H K. Iterative algorithms for nonlinnear operators. J Lond Math Soc, 2002, 66:240-256
[21] Maingé P E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Analysis, 2008, 16:899-912
[22] Blum E, Oettli W. From optimization and variational inequalities to equilibrium problems. Math Stud, 1994, 63:123-145
/
| 〈 |
|
〉 |