On the Minimal Displacement Vector of the Douglas-Rachford Operator

DOI10.1016/J.ORL.2021.01.003arXiv2009.01201WikidataQ120716987 ScholiaQ120716987MaRDI QIDQ6348264FDOQ6348264

Publication date: 2 September 2020

Abstract: The Douglas-Rachford algorithm can be represented as the fixed point iteration of a firmly nonexpansive operator. When the operator has no fixed points, the algorithm's iterates diverge, but the difference between consecutive iterates converges to the so-called minimal displacement vector, which can be used to certify infeasibility of an optimization problem. In this paper, we establish new properties of the minimal displacement vector, which allow us to generalize some existing results.

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Set-valued and variational analysis (49J53)

This page was built for publication: On the Minimal Displacement Vector of the Douglas-Rachford Operator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348264)