Modified Relaxed CQ Iterative Algorithms for the Split Feasibility Problem†
AbstractThe 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. View Full-Text
Share & Cite This Article
Wang, X.; Zhao, J.; Hou, D. Modified Relaxed CQ Iterative Algorithms for the Split Feasibility Problem. Mathematics 2019, 7, 119.
Wang X, Zhao J, Hou D. Modified Relaxed CQ Iterative Algorithms for the Split Feasibility Problem. Mathematics. 2019; 7(2):119.Chicago/Turabian Style
Wang, Xinglong; Zhao, Jing; Hou, Dingfang. 2019. "Modified Relaxed CQ Iterative Algorithms for the Split Feasibility Problem." Mathematics 7, no. 2: 119.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.