Poster Presentation by:    Anteneh Gebrie
Supervisors:       W. Moursi and L. Tuncel

Title:  Analysis of Douglas–Rachford algorithm for inconsistent convex
feasibility problems

Abstract:
Douglas-Rachford algorithm (DRA) for inconsistent convex feasibility problem
has been studied by Bauschke-Combettes-Luke (2004) and then by
Bauschke-Moursi (2016-2017) relying on the notion of the existence of a best
approximation pair that defines the displacement vector.  In this work,
building on and complementing the results in the literature,
we provide new convergence analyses for DRA for certain classes
of inconsistent convex feasibility problems.