Iterative process for solving a multiple-set split feasibility problem
Yazheng Dang, Zhonghui Xue · Journal of Inequalities and Applications · 2015
This paper deals with a variant relaxed CQ algorithm by using a new searching direction, which is not the gradient of a corresponding function. The strategy is to intend to improve the convergence. Its convergence is proved under some suitable conditions. Numerical results illustrate that our variant relaxed CQ algorithm converges more quickly than the existing algorithms.