Relaxed inertial accelerated algorithms for solving split equality feasibility problem

Volume 10, Issue 8, pp 4109--4121

Publication Date: 2017-08-07

http://dx.doi.org/10.22436/jnsa.010.08.07

M. X. Li
X. P. Kao
H. T. Che

Abstract

In this paper, we study the split equality feasibility problem and present two algorithms for solving the problem with special structure. We prove the weak convergence of these algorithms under mild conditions. Especially, the selection of stepsize is only dependent on the information of current iterative points, but independent from the prior knowledge of operator norms. These algorithms provide new ideas for solving the split equality feasibility problem. Numerical results demonstrate the feasibility and effectiveness of these algorithms.