Full Text: PDF
Received April 7, 2021; Accepted November 25, 2021; Published December 17, 2021
Abstract. The multiple-sets split feasibility problem is to find a point such that , where and are nonempty, closed, and convex subsets, and are Hilbert spaces, and is a bounded and linear operator. In this paper, we present two modified relaxed CQ algorithms with the step size determined by the Armijo-line search. Under mild conditions, we establish the weak convergence, and provide numerical experiments to illustrate the effectiveness of the proposed algorithms.
How to Cite this Article:
Yaxuan Zhang, Yingying Li, Two modified relaxed CQ algorithms for the multiple-sets split feasibility problem, Journal of Nonlinear Functional Analysis, Vol. 2021 (2021), Article ID 39, pp. 1-14.