Graph splitting methods: fixed points and strong convergence for linear subspaces

In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim. 2024;34:1569–1594] by Bredies, Chenchene and Naldi. We particularize it to the case where the maximally monotone operators are normal cones of closed linear subspaces and provide an explicit formula for the limit points of the graph splitting schemes. We exemplify these results on some particular algorithms, unifying in this way some results previously derived as well as obtaining new ones.