Modified Relaxed CQ Iterative Algorithms for the Split Feasibility Problem

Mathematics

Xinglong Wang¹  Jing Zhao²  Dingfang Hou² 

[1] College of Air Traffic Management, Civil Aviation University of China, Tianjin 300300, China;College of Science, Civil Aviation University of China, Tianjin 300300, China;

关键词: split feasibility problem;    relaxed CQ algorithm;    convergence;    Hilbert space;   

DOI  :  10.3390/math7020119

来源: DOAJ

【 摘 要 】

The split feasibility problem models inverse problems arising from phase retrievals problems and intensity-modulated radiation therapy. For solving the split feasibility problem, Xu proposed a relaxed CQ algorithm that only involves projections onto half-spaces. In this paper, we use the dual variable to propose a new relaxed CQ iterative algorithm that generalizes Xu’s relaxed CQ algorithm in real Hilbert spaces. By using projections onto half-spaces instead of those onto closed convex sets, the proposed algorithm is implementable. Moreover, we present modified relaxed CQ algorithm with viscosity approximation method. Under suitable conditions, global weak and strong convergence of the proposed algorithms are proved. Some numerical experiments are also presented to illustrate the effectiveness of the proposed algorithms. Our results improve and extend the corresponding results of Xu and some others.

【 授权许可】

Unknown