The Problem of Split Convex Feasibility and Its Alternating Approximation Algorithms  

作　　者：Zhen Hua HE Ji Tao SUN 

机构地区：[1]Department of Mathematics,Tongji University [2]Department of Mathematics,Honghe University

出　　处：《Acta Mathematica Sinica,English Series》2015年第12期1857-1871,共15页数学学报（英文版）

基　　金：Supported by National Natural Science Foundation of China(Grant No.61174039);the Natural Science Foundation of Yunnan Province(Grant No.2010ZC152);the Candidate Foundation of Youth Academic Experts at Honghe University(Grant No.2014HB0206)

摘　　要：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.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.

关 键 词：Alternating algorithm problem of split convex feasibility strong convergent theorem 

分 类 号：O177[理学—数学]