In this paper, we present a convergence rate analysis for the inexact Krasnosel'skiĭ–Mann
iteration built from non-expansive operators. The presented results include two main parts …

We propose generic acceleration schemes for a wide class of optimization and iterative
schemes based on relaxation and inertia. In particular, we introduce methods that …

Recently, several authors have shown local and global convergence rate results for Douglas–
Rachford splitting under strong monotonicity, Lipschitz continuity, and cocoercivity …

Although the central role of educational intermediaries that can connect research and
practice is increasingly appreciated, our present understanding of their motivations …

The alternating direction method of multipliers (ADMM) is one of the most widely used first-
order optimisation methods in the literature owing to its simplicity, flexibility and efficiency …

The Douglas–Rachford method is a splitting method frequently employed for finding zeros of
sums of maximally monotone operators. When the operators in question are normal cone …

In this paper, we present a novel derivation of an existing algorithm for distributed
optimization termed the primal-dual method of multipliers (PDMM). In contrast to its initial …

Abstract The Douglas–Rachford and alternating direction method of multipliers are two
proximal splitting algorithms designed to minimize the sum of two proper lower semi …

We introduce and study a geometric modification of the Douglas–Rachford method called
the Circumcentered–Douglas–Rachford method. This method iterates by taking the …

In this paper we present a new iterative projection method for finding the closest point in the
intersection of convex sets to any arbitrary point in a Hilbert space. This method, termed …