Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
From MaRDI portal
Publication:2814277
zbMath1350.65057arXiv1501.06603MaRDI QIDQ2814277
Heinz H. Bauschke, Minh N. Dao, Hung M. Phan, Dominikus Noll
Publication date: 21 June 2016
Full work available at URL: https://arxiv.org/abs/1501.06603
convergenceprojectioniterative methodsconvex setalternating projectionsconvex feasibility problemproximal point algorithmproximity operatorDouglas-Rachford algorithmproximal mapping
Related Items (15)
On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ Convergence analysis of two-step inertial Douglas-Rachford algorithm and application ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ The circumcentered-reflection method achieves better rates than alternating projections ⋮ Linear Convergence of Projection Algorithms ⋮ Extremality, stationarity and generalized separation of collections of sets ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators ⋮ Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
This page was built for publication: Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
