On the local convergence of the Douglas-Rachford algorithm
From MaRDI portal
Publication:2510692
DOI10.1007/s00013-014-0652-2zbMath1344.47044arXiv1401.6188OpenAlexW2065416951MaRDI QIDQ2510692
Heinz H. Bauschke, Dominikus Noll
Publication date: 1 August 2014
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6188
Nonconvex programming, global optimization (90C26) Iterative procedures involving nonlinear operators (47J25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (26)
On local convergence of the method of alternating projections ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ Global Convergence of Splitting Methods for Nonconvex Composite Optimization ⋮ Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging ⋮ Circumcentering the Douglas-Rachford method ⋮ A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Union averaged operators with applications to proximal algorithms for MIN-convex functions ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ General splitting methods with linearization for the split feasibility problem ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Algorithms based on unions of nonexpansive maps ⋮ Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results ⋮ Convergence Analysis of the Relaxed Douglas--Rachford Algorithm ⋮ Norm convergence of realistic projection and reflection methods ⋮ Alternating projections with applications to Gerchberg-Saxton error reduction ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Method of alternating projections for the general absolute value equation ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On local convergence of the method of alternating projections
- Restricted normal cones and the method of alternating projections: theory
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Convergence of sequential and asynchronous nonlinear paracontractions
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On cluster points of alternating projections
- Searching with iterated maps
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: On the local convergence of the Douglas-Rachford algorithm
