A unifiying graph-based analysis of projection algorithms for linear subspaces

F. J. Aragón Artacho, H. H. Bauschke, R. Campoy, C. López Pastor

This work develops a general analysis for the fixed points of the operators defining the graph splitting methods by Bredies, Chenchene and Naldi. We particularize it to the case of projection algorithms for 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.

Keywords: Graph Splitting Methods,Projection Algorithms,Fixed Points,Strong Convergence

Scheduled

Continuous Optimization I
June 10, 2025  11:30 AM
MR 3

Other papers in the same session

Forward-backward algorithms devised by graphs

F. J. Aragón Artacho, R. Campoy García, C. López Pastor

New notions of proper minimality in set optimization with finite dimensional spaces

L. Huerga Pastor

Numerical Analysis of state-constrained elliptic multiobjective control problems: Finite element discretization and error estimates

M. Sama Meige, A. Khan

Optimality conditions for Semi-infinite Interval Equilibrium Problems with constraints

G. Ruiz-Garzón, R. Osuna-Gómez, A. Rufián-Lizana, A. Beato-Moreno

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.