Partially Projective Algorithm for the Split Feasibility Problem with Visualization of the Solution Set

Abstract

This paper introduces a new three-step algorithm to solve the split feasibility problem. The main advantage is that one of the projective operators interferes only in the final step, resulting in less computations at each iteration. An example is provided to support the theoretical approach. The numerical simulation reveals that the newly introduced procedure has increased performance compared to other existing methods, including the classic CQ algorithm. An interesting outcome of the numerical modeling is an approximate visual image of the solution set.</jats:p