Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
From MaRDI portal
fixed pointinconsistent feasibility problemlinear convergencemetric subregularitynonconvexprojectionrelaxed averaged alternating reflectionssubtransversalitysuperregular
Set-valued and variational analysis (49J53) Sensitivity, stability, well-posedness (49K40) Numerical methods based on necessary conditions (49M05) Numerical methods of relaxation type (49M20) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)
Cites work
- Best approximation in inner product spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- EXISTENCE AND APPROXIMATION OF SOLUTIONS OF NONLINEAR VARIATIONAL INEQUALITIES
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Functional Operators (AM-22), Volume 2
- Implicit Functions and Solution Mappings
- Linear convergence of the Douglas-Rachford method for two closed sets
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Local linear convergence for alternating and averaged nonconvex projections
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the local convergence of the Douglas-Rachford algorithm
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Relaxed averaged alternating reflections for diffraction imaging
- Set regularities and feasibility problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strong CHIP, normality, and linear regularity of convex sets
- The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
- There is no variational characterization of the cycles in the method of periodic projections
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(14)- A convergence analysis for a convex version of Dikin's algorithm
- \( \alpha \)-firmly nonexpansive operators on metric spaces
- A unified Douglas-Rachford algorithm for generalized DC programming
- Convergence analysis of two-step inertial Douglas-Rachford algorithm and application
- Projection methods for high numerical aperture phase retrieval
- Provable Phase Retrieval with Mirror Descent
- Convergence Analysis of the Relaxed Douglas-Rachford Algorithm
- A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis
- Generalized alternating projections on manifolds and convex sets
- Tikhonov regularized iterative methods for nonlinear problems
- A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems
- A convergent relaxation of the Douglas-Rachford algorithm
- Cyclic relaxed Douglas-Rachford splitting for inconsistent nonconvex feasibility
- Convergence of a randomized Douglas-Rachford method for linear system
This page was built for publication: Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217595)
