Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems

This repository contains code for the numerical experiments conducted in the paper (Millan, Ferreira, and Ugon 2021).

In these experiments we apply the approximate Douglas-Rachford algorithm. This is done using an approximate projection (based on the conditional gradient method). See paper for details.

References

Millan, R. Diaz, O. P. Ferreira, and J. Ugon. 2021. “Approximate Douglas-Rachford Algorithm for Two-Sets Convex Feasibility Problems.” https://arxiv.org/abs/2105.13005.