A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting

2016/09/28 by Giladi, Ohad
#FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1609.08751

Abstract

Using the construction of a Lyapunov function, it is shown that the Douglas-Rachford iteration with respect to a sphere and a line in \mathbb R^d is robustly KL-stable. This implies a convergence which is stronger than uniform convergence on compact sets.

Related

• Linear Convergence of the Douglas-Rachford Method for Two Closed Sets
• Douglas--Rachford is the best projection method
• On the local convergence of the Douglas-Rachford algorithm
• A convergent relaxation of the Douglas-Rachford algorithm
• On the Douglas-Rachford algorithm for solving possibly inconsistent optimization problems