Skip to content
Preprint

A Convex Feasibility Problem for Which Douglas-Rachford Converges Only Weakly

Oct 2026 · 1 citation · 11 references
Mathematics

Abstract

We provide two closed, convex sets with nonempty intersection and an initial point for which the Douglas-Rachford algorithm converges weakly but not strongly. This resolves an open question as noted earlier by Arag\'on Artacho, Borwein and Tam (2014, Remark 2.2). Our construction is a simple lift of a recent construction by Bauschke and Tung concerning firmly nonexpansive operators.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.