Relocated Fixed-Point Iterations with Applications to Variable Stepsize Resolvent Splitting (2507.07428v1)
Abstract: In this work, we develop a convergence framework for iterative algorithms whose updates can be described by a one-parameter family of nonexpansive operators. Within the framework, each step involving one of the main algorithmic operators is followed by a second step which ''relocates'' fixed-points of the current operator to the next. As a consequence, our analysis does not require the family of nonexpansive operators to have a common fixed-point, as is common in the literature. Our analysis uses a parametric extension of the demiclosedness principle for nonexpansive operators. As an application of our convergence results, we develop a version of the graph-based extension of the Douglas--Rachford algorithm for finding a zero of the sum of $N\geq 2$ maximally monotone operators, which does not require the resolvent parameter to be constant across iterations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.