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

Jan Quan, Panagiotis Patrinos · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.28414 · cited by 0 works (OpenAlex) · open-access PDF

Chinese

我们提供两个封闭的,圆形的集合,无空的交叉点和一个初始点,道格拉斯 - 拉赫福德算法的汇聚弱,但不是强大的。这解决了一个开放的问题,正如Aragón Artacho,Borwein和Tam(2014年)所指出的那样。

Machine translation (Meta M2M100); the English original follows.

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ón 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.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Mathematics, Intersection (aeronautics), Regular polygon, Lift (data mining), Simple (philosophy), Point (geometry)

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.28414, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange