A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
From MaRDI portal
Publication:670659
DOI10.1007/s10898-018-0677-3zbMath1417.90118arXiv1706.04846OpenAlexW3098376775MaRDI QIDQ670659
Publication date: 18 March 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.04846
stabilityglobal convergenceLyapunov functionNewton's methodprojectionlinear convergencemethod of alternating projectionsfeasibility problemDouglas-Rachford algorithmnonconvex setgraph of a functionzero of a function
Nonconvex programming, global optimization (90C26) Stability of topological dynamical systems (37B25) Fixed-point theorems (47H10)
Related Items (13)
Circumcentering reflection methods for nonconvex feasibility problems ⋮ Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ Variational analysis down under open problem session ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators ⋮ APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS ⋮ Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Cites Work
- On the order of the operators in the Douglas-Rachford algorithm
- On local convergence of the method of alternating projections
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- The Douglas-Rachford algorithm for the case of the sphere and the line
- Local linear convergence for alternating and averaged nonconvex projections
- Transversality and alternating projections for nonconvex sets
- 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
- Subgradient projectors: extensions, theory, and characterizations
- The Douglas-Rachford algorithm in the affine-convex case
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- On the Douglas-Rachford algorithm
- Global convergence of a non-convex Douglas-Rachford iteration
- On Fej\'er monotone sequences and nonexpansive mappings
- Linear convergence of the Douglas–Rachford method for two closed sets
- Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
- The Douglas–Rachford Algorithm in the Absence of Convexity
- On Weak Convergence of the Douglas–Rachford Method
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- Linear Convergence of Projection Algorithms
- On Subgradient Projectors
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
