Related papers: On the order of the operators in the Douglas-Rachf…
The main result of the present theoretical paper is an original decomposition formula for the proximal operator of the sum of two proper, lower semicontinuous and convex functions $f$ and $g$. For this purpose, we introduce a new operator,…
We expand upon previous work that examined behavior of the iterated Douglas-Rachford method for a line and a circle by considering two generalizations: that of a line and an ellipse and that of a line together with a $p$-sphere. With…
Monotone inclusions have wide applications in solving various convex optimization problems arising in signal and image processing, machine learning, and medical image reconstruction. In this paper, we propose a new splitting algorithm for…
Douglas-Rachford (DR) algorithm is analyzed for Fourier phase retrieval with a single random phase mask. Local, geometric convergence to a unique fixed point is proved with numerical demonstration of global convergence.
We introduce an inertial variant of the forward-Douglas-Rachford splitting and analyze its convergence. We specify an instance of the proposed method to the three-composite convex minimization template. We provide practical guidance on the…
This work proposes block-coordinate fixed point algorithms with applications to nonlinear analysis and optimization in Hilbert spaces. The asymptotic analysis relies on a notion of stochastic quasi-Fej\'er monotonicity, which is thoroughly…
Recently, several authors have shown local and global convergence rate results for Douglas-Rachford splitting under strong monotonicity, Lipschitz continuity, and cocoercivity assumptions. Most of these focus on the convex optimization…
Using the construction of a Lyapunov function, it is shown that the Douglas-Rachford iteration with respect to a sphere and a line in $\mathbb R^d$ is robustly $\mathcal{KL}$-stable. This implies a convergence which is stronger than uniform…
We address the solution of time-varying optimization problems characterized by the sum of a time-varying strongly convex function and a time-invariant nonsmooth convex function. We design an online algorithmic framework based on…
The problem of applying Nash-Moser Newton methods to obtain periodic solutions of the compressible Euler equations has led authors to identify the main obstacle, namely, how to invert operators which impose periodicity when they are based…
We propose an extended forward-backward algorithm for approximating a zero of a maximal monotone operator which can be split as the extended sum of two maximal monotone operators. We establish the weak convergence in average of the sequence…
We consider a class of multi-agent optimization problems, where each agent has a local objective function that depends on its own decision variables and the aggregate of others, and is willing to cooperate with other agents to minimize the…
We study the asymptotic behavior of the trajectory of a nonautonomous evolution equation governed by a quasi-nonexpansive operator in Hilbert spaces. We prove the weak convergence of the trajectory to a fixed point of the operator by…
We introduce and study the convergence properties of a projection-type algorithm for solving the variational inequality problem for point-to-set operators. No monotoni\-city assumption is used in our analysis. The operator defining the…
This paper provides a theoretical and numerical comparison of classical first-order splitting methods for solving smooth convex optimization problems and cocoercive equations. From a theoretical point of view, we compare convergence rates…
This paper investigates the distributed fixed point finding problem for a global operator over a directed and unbalanced multi-agent network, where the global operator is quasinonexpansive and only partially accessible to each individual…
We study the existence and uniqueness of (locally) absolutely continuous trajectories of a dynamical system governed by a nonexpansive operator. The weak convergence of the orbits to a fixed point of the operator is investigated by relying…
We prove that the sequences generate by the Douglas-Rachford method converge weakly to a solution of the inclusion problem
In this work, we introduce the notion of warped Yosida regularization and study the asymptotic behavior of the orbit of dynamical systems generated by warped Yosida regularization, which includes Douglas-Rachford dynamical system. We…
Frugal resolvent splittings are a class of fixed point algorithms for finding a zero in the sum of the sum of finitely many set-valued monotone operators, where the fixed point operator uses only vector addition, scalar multiplication and…