The Douglas-Rachford algorithm for the case of the sphere and the line
From MaRDI portal
Publication:746821
DOI10.1007/s10898-015-0296-1zbMath1353.90175OpenAlexW865342791MaRDI QIDQ746821
Publication date: 20 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0296-1
Related Items
Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Learning without loss ⋮ 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 ⋮ Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ 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 ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ 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 ⋮ Ergodic behaviour of a Douglas-Rachford operator away from the origin ⋮ 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 ⋮ Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm
Cites Work
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Global convergence of a non-convex Douglas-Rachford iteration
- 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
- Searching with iterated maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
