On Global Convergence Rate of Two Acceleration Projection Algorithms for Solving the Multiple-Sets Split Feasibility Problem

Abstract

In this paper, we introduce two fast projection algorithms for solving the multiple-sets split feasibility problem (MSFP). Our algorithms accelerate algorithms proposed in [8] and are proved to have a global convergence rate O(1/n2). Preliminary numerical experiments show that these algorithms are practical and promising. 

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Donga2016OnGC, title={On Global Convergence Rate of Two Acceleration Projection Algorithms for Solving the Multiple-Sets Split Feasibility Problem}, author={Qiao-Li Donga and Songnian Hea and Yanmin Zhaoc and Q. L. Dong and Shu-Guang He and Y. Zhao}, year={2016} }