The alternating direction method of multipliers is a powerful operator splitting technique for
solving structured optimization problems. For convex optimization problems, it is well known …

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 …

The Douglas--Rachford algorithm is a classical and powerful splitting method for minimizing
the sum of two convex functions and, more generally, finding a zero of the sum of two …

In recent times the Douglas–Rachford algorithm has been observed empirically to solve a
variety of nonconvex feasibility problems including those of a combinatorial nature. For …

In this paper, we study the generalized Douglas–Rachford algorithm and its cyclic variants
which include many projection-type methods such as the classical Douglas–Rachford …

More than 40 years ago, Lions and Mercier introduced in a seminal paper the Douglas–
Rachford algorithm. Today, this method is well-recognized as a classic and highly …

Solving feasibility problems is a central task in mathematics and the applied sciences. One
particularly successful method is the Douglas--Rachford algorithm. In this paper, we provide …

In order to accelerate the Douglas–Rachford method we recently developed the
circumcentered-reflection method, which provides the closest iterate to the solution among …

Abstract The Douglas–Rachford projection algorithm is an iterative method used to find a
point in the intersection of closed constraint sets. The algorithm has been experimentally …

Projection algorithms are well known for their simplicity and flexibility in solving feasibility
problems. They are particularly important in practice owing to minimal requirements for …