Split feasibility problems.
(III) Split equality feasibility problems.
Furthermore, we use them to solve some split feasibility problems.
This problem also covers various forms of feasibility problems.
Finally, we apply our results to Convex Feasibility Problems (CFP).
As applications, we study unique minimum norm solutions of the following problems: multiple sets split feasibility problems, system of convex constrained linear inverse problems, convex constrained linear inverse problems, split feasibility problems, convex feasibility problems.
In a non-cooperative network, there are M independent feasibility problems, while for the cooperative network, we have dependent feasibility problems.
Finally, we apply our results for solving convex feasibility problems in Hilbert spaces.
Then, we apply our results for solving convex feasibility problems in Banach spaces.
Some methods have been proposed to solve split feasibility problems; see, for instance, [2, 7 14].
Besides, it involves solving a sequence of convex feasibility problems, which is computationally expensive.
