Global convergence of a non-convex Douglas-Rachford iteration
From MaRDI portal
Publication:2434636
DOI10.1007/s10898-012-9958-4zbMath1286.90114arXiv1203.2392OpenAlexW3105839578WikidataQ56935422 ScholiaQ56935422MaRDI QIDQ2434636
Francisco J. Aragón Artacho, Jonathan M. Borwein
Publication date: 6 February 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.2392
global convergencefixed point theoryprojection algorithmsignal reconstructionDouglas-Rachford algorithmnonconvex feasibility problem
Related Items
On the order of the operators in the Douglas-Rachford algorithm ⋮ On the Douglas-Rachford algorithm ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit ⋮ Entropic Approximation of Wasserstein Gradient Flows ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ Circumcentering the Douglas-Rachford method ⋮ Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination ⋮ 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 ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ 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 ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ 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 ⋮ General splitting methods with linearization for the split feasibility problem ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Duality and Convex Programming ⋮ Linear convergence of the Douglas–Rachford method for two closed sets ⋮ The Douglas-Rachford algorithm for the case of the sphere and the line ⋮ Ergodic behaviour of a Douglas-Rachford operator away from the origin ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ 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 ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Cites Work
