New Approach to Split Variational Inclusion Issues through a Three-Step Iterative Process

Split variational inclusions are revealed as a large class of problems that includes several other pre-existing split-type issues: split feasibility, split zeroes problems, split variational inequalities and so on. This makes them not only a rich direction of theoretical study but also one with important and varied practical applications: large dimensional linear systems, optimization, signal reconstruction, boundary value problems and others. In this paper, the existing algorithmic tools are complemented by a new procedure based on a three-step iterative process. The resulting approximating sequence is proved to be weakly convergent toward a solution. The operation mode of the new algorithm is tracked in connection with mixed optimization–feasibility and mixed linear–feasibility systems. Standard polynomiographic techniques are applied for a comparative visual analysis of the convergence behavior.