# The Douglas-Rachford Algorithm for Convex and Nonconvex Feasibility Problems

arXiv: https://arxiv.org/abs/1904.09148 · HTML: https://mlsanity.com/paper/1904.09148/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Apr 2019.

## Built on by (most cited first, 7 of 7)

- [Avoiding Traps in Nonconvex Problems](https://mlsanity.com/paper/2106.05206/) (2021)
- [Hybrid Model and Data Driven Algorithm for Online Learning of Any-to-Any Path Loss Maps](https://mlsanity.com/paper/2107.06677/) (2021)
- [Solving a directed percolation inverse problem](https://mlsanity.com/paper/2201.12222/) (2022)
- [Holistic Processing of Colour Images Using Novel Quaternion-Valued Wavelets on the Plane](https://mlsanity.com/paper/2308.16875/) (2023)
- [I2I-PR: Deep Iterative Refinement for Phase Retrieval using Image-to-Image Diffusion Models](https://mlsanity.com/paper/2507.09609/) (2025)
- [Finding Structure in Continual Learning](https://mlsanity.com/paper/2602.04555/) (2026)
- [Task Switching Without Forgetting via Proximal Decoupling](https://mlsanity.com/paper/2604.18857/) (2026)

## Abstract (arXiv)

The Douglas-Rachford method, a projection algorithm designed to solve continuous optimization problems, forms the basis of a useful heuristic for solving combinatorial optimization problems. In order to successfully use the method, it is necessary to formulate the problem at hand as a feasibility problem with constraint sets having efficiently computable nearest points. In this self-contained tutorial, we develop the convergence theory of projection algorithms within the framework of fixed point iterations, explain how to devise useful feasibility problem formulations, and demonstrate the application of the Douglas-Rachford method to said formulations. The paradigm is then illustrated on two concrete problems: a generalization of the "eight queens puzzle" known as the "(m,n)-queens problem", and the problem of constructing a probability distribution with prescribed moments.