The Problem of Split Convex Feasibility and Its Alternating Approximation Algorithms

被引:3
作者
He, Zhen Hua [1 ,2 ]
Sun, Ji Tao [1 ]
机构
[1] Tongji Univ, Dept Math, Shanghai 200092, Peoples R China
[2] Honghe Univ, Dept Math, Mengzi 661199, Peoples R China
基金
中国国家自然科学基金;
关键词
Alternating algorithm; problem of split convex feasibility; strong convergent theorem; CQ-ALGORITHM;
D O I
10.1007/s10114-015-4602-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper studies the problem of split convex feasibility and a strong convergent alternating algorithm is established. According to this algorithm, some strong convergent theorems are obtained and an affirmative answer to the question raised by Moudafi is given. At the same time, this paper also generalizes the problem of split convex feasibility.
引用
收藏
页码:1857 / 1871
页数:15
相关论文
共 8 条
[1]  
[Anonymous], 1994, Numer. Algor., DOI [DOI 10.1007/BF02142692, 10.1007/BF02142692]
[2]  
[Anonymous], J MATH ANAL APPL
[4]   Moudafi's open question and simultaneous iterative algorithm for general split equality variational inclusion problems and general split equality optimization problems [J].
Chang, Shih-sen ;
Wang, Lin ;
Tang, Yong Kun ;
Wang, Gang .
FIXED POINT THEORY AND APPLICATIONS, 2014,
[5]  
Moudafi A, 2014, J NONLINEAR CONVEX A, V15, P809
[6]   A relaxed alternating CQ-algorithm for convex feasibility problems [J].
Moudafi, Abdellatif .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2013, 79 :117-121
[7]   Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces [J].
Xu, Hong-Kun .
INVERSE PROBLEMS, 2010, 26 (10)
[8]   The relaxed CQ algorithm solving the split feasibility problem [J].
Yang, QZ .
INVERSE PROBLEMS, 2004, 20 (04) :1261-1266