A Lyapunov function construction for a non-convex Douglas-Rachford iteration

DOI10.1007/S10957-018-1405-3zbMath1440.47052arXiv1708.08697OpenAlexW2896291441WikidataQ129081308 ScholiaQ129081308MaRDI QIDQ1730763

Björn S. Rüffer, Ohad Giladi

Publication date: 6 March 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

global convergenceLyapunov functionnon-convex optimizationDouglas-Rachford iterationrobust \(\mathcal {KL}\)-stability

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Iterative procedures involving nonlinear operators (47J25) Lyapunov and storage functions (93D30) Dynamical systems in optimization and economics (37N40)

Related Items (4)

Circumcentering reflection methods for nonconvex feasibility problems ⋮ Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ LyapunovFunDR

Uses Software

• GitHub
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Classical converse theorems in Lyapunov's second method
• On the order of the operators in the Douglas-Rachford algorithm
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
• The Douglas-Rachford algorithm for the case of the sphere and the line
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting
• Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres
• A Lyapunov function construction for a non-convex Douglas-Rachford iteration
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• 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
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Linear Convergence of Projection Algorithms
• 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

This page was built for publication: A Lyapunov function construction for a non-convex Douglas-Rachford iteration