Abstract The Douglas–Rachford algorithm is an optimization method that can be used for
solving feasibility problems. To apply the method, it is necessary that the problem at hand is …

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 …

As first-order optimization methods become the method of choice for solving large-scale
optimization problems, optimization solvers based on first-order algorithms are being built …

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 …

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 …

We consider a class of generalized DC (difference-of-convex functions) programming, which
refers to the problem of minimizing the sum of two convex (possibly nonsmooth) functions …

Despite the vast literature on DRS and ADMM, there has been very little work analyzing their
behavior under pathologies. Most analyses assume a primal solution exists, a dual solution …

We study the behavior of the Douglas–Rachford algorithm on the graph vertex-coloring
problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices …

Abstract We present the Douglas-Rachford algorithm as a successful heuristic for solving
graph coloring problems. Given a set of colors, these types of problems consist in assigning …