The Split Feasibility Problem and Its Solution Algorithm

Abstract EN

The split feasibility problem arises in many fields in the real world, such as signal processing, image reconstruction, and medical care.

In this paper, we present a solution algorithm called memory gradient projection method for solving the split feasibility problem, which employs a parameter and two previous iterations to get the next iteration, and its step size can be calculated directly.

It not only improves the flexibility of the algorithm, but also avoids computing the largest eigenvalue of the related matrix or estimating the Lipschitz constant in each iteration.

Theoretical convergence results are established under some suitable conditions.