In this paper, first, we review the projection and contraction methods for solving the split
feasibility problem (SFP), and then by using the inverse strongly monotone property of the …

In this article, we introduce a general splitting method with linearization to solve the split
feasibility problem and propose a way of selecting the stepsizes such that the …

In the present paper, we explore a family of projection gradient methods for solving the
multiple-sets split feasibility problem, which include the cyclic/simultaneous iteration …

In this paper, based on a merit function of the split feasibility problem (SFP), we present a
Newton projection method for solving it and analyze the convergence properties of the …

We propose two new double projection algorithms for solving the split feasibility problem
(SFP). Different from the extragradient projection algorithms, the proposed algorithms do not …

For the split feasibility problem, we propose a new type of solution method by introducing a
new searching direction with fixed stepsize. Its global convergence is proved under a …

In this paper we present several relaxed inexact projection methods for the split feasibility
problem (SFP). Each iteration of the first proposed algorithm consists of a projection onto a …

Abstract Very recently, Dang and Gao (Inverse Probl 27: 015007, 2011) introduced a KM-CQ
algorithm with strong convergence for the split feasibility problem. In this paper, we will …

The split feasibility problem (SFP) is to find so that, where C and Q are non-empty closed
convex subsets in Hilbert spaces and, respectively, and A is a linear bounded operator from …

In this paper, we study an iterative method for solving the multiple-set split feasibility
problem: find a point in the intersection of a finite family of closed convex sets in one space …