Linear convergence of the Douglas–Rachford method for two closed sets
From MaRDI portal
Publication:2790885
DOI10.1080/02331934.2015.1051532zbMath1334.49089arXiv1401.6509OpenAlexW1690193285MaRDI QIDQ2790885
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6509
strong regularitysuperregularityDouglas-Rachford method\(R\)-linear convergenceFejér monotonicitylinear regularityaffine-hull reduction
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Decomposition methods (49M27)
Related Items
On the order of the operators in the Douglas-Rachford algorithm ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ 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 ⋮ Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator ⋮ Convergence analysis of two-step inertial Douglas-Rachford algorithm and application ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ ITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICE ⋮ 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 ⋮ Regularity properties of non-negative sparsity sets ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Local convergence properties of Douglas-Rachford and alternating direction method of multipliers ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ Some new characterizations of intrinsic transversality in Hilbert spaces ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ Set regularities and feasibility problems ⋮ Tight global linear convergence rate bounds for Douglas-Rachford splitting ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ Construction of quantum states with special properties by projection methods ⋮ Regularity of sets under a reformulation in a product space with reduced dimension ⋮ Provable Phase Retrieval with Mirror Descent ⋮ The Glowinski-Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ 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 ⋮ Orbital geometry and group majorisation in optimisation ⋮ Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ Necessary conditions for linear convergence of iterated expansive, set-valued mappings ⋮ Convergence Analysis of the Relaxed Douglas--Rachford Algorithm ⋮ Ergodic behaviour of a Douglas-Rachford operator away from the origin ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ Linear Convergence of Projection Algorithms ⋮ Alternating projections with applications to Gerchberg-Saxton error reduction ⋮ 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 ⋮ Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
Cites Work
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- The method of alternating relaxed projections for two nonconvex sets
- Local linear convergence for alternating and averaged nonconvex projections
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Global convergence of a non-convex Douglas-Rachford iteration
- About regularity of collections of sets
- The Douglas–Rachford Algorithm in the Absence of Convexity
- On Weak Convergence of the Douglas–Rachford Method
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Variational Analysis and Generalized Differentiation I
- On Projection Algorithms for Solving Convex Feasibility Problems
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
