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

DOI10.1007/s11228-018-0477-4zbMath1471.47041arXiv1609.08751OpenAlexW2963847952MaRDI QIDQ1653319

Ohad Giladi

Publication date: 3 August 2018

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.08751

zbMATH Keywords

Lyapunov function\(\mathcal {KL}\)-stabilityDouglas-Rachford iteration

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Difference equations (39A99) Variational and other types of inclusions (47J22)

Related Items

A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ Ergodic behaviour of a Douglas-Rachford operator away from the origin

Uses Software

• LyapunovFunDR

Cites Work

• Unnamed Item
• Classical converse theorems in Lyapunov's second method
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• The Douglas-Rachford algorithm for the case of the sphere and the line
• Global convergence of a non-convex Douglas-Rachford iteration
• On the local convergence of the Douglas-Rachford algorithm
• Linear convergence of the Douglas–Rachford method for two closed sets
• The Douglas–Rachford Algorithm in the Absence of Convexity
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Searching with iterated maps
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• On the Robustness of $\mathcalKL$-stability for Difference Inclusions: Smooth Discrete-Time Lyapunov Functions
• On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces