Global convergence of a non-convex Douglas-Rachford iteration
arXiv:1203.2392 · doi:10.1007/s10898-012-9958-4
Abstract
We establish a region of convergence for the proto-typical non-convex Douglas-Rachford iteration which finds a point on the intersection of a line and a circle. Previous work on the non-convex iteration [2] was only able to establish local convergence, and was ineffective in that no explicit region of convergence could be given.
Cited by in corpus (17)
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems
- A Cyclic Douglas-Rachford Iteration Scheme
- Douglas-Rachford Feasibility Methods for Matrix Completion Problems
- Circumcentering the Douglas--Rachford method
- Global Behavior of the Douglas-Rachford Method for a Nonconvex Feasibility Problem
- A new projection method for finding the closest point in the intersection of convex sets
- A Proximal Approach for a Class of Matrix Optimization Problems
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- On the Circumcentered-Reflection Method for the Convex Feasibility Problem
- Dynamics of the Douglas-Rachford Method for Ellipses and p-Spheres
- Reflection methods for inverse problems with application to protein conformation determination
- The Douglas--Rachford algorithm for a hyperplane and a doubleton
- A Lyapunov function construction for a non-convex Douglas-Rachford iteration
- The Douglas-Rachford Algorithm for Weakly Convex Penalties
- On the order of the operators in the Douglas-Rachford algorithm