The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
From MaRDI portal
Publication:2189471
DOI10.1007/s00186-019-00691-9zbMath1435.65090arXiv1904.09148OpenAlexW2991107648WikidataQ126663066 ScholiaQ126663066MaRDI QIDQ2189471
Rubén Campoy, Matthew K. Tam, Francisco J. Aragón Artacho
Publication date: 15 June 2020
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.09148
Related Items (15)
Circumcentering reflection methods for nonconvex feasibility problems ⋮ A product space reformulation with reduced dimension for splitting algorithms ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ Circumcentric directions of cones ⋮ Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions ⋮ The block-wise circumcentered-reflection method ⋮ On the centralization of the circumcentered-reflection method ⋮ Regularity of sets under a reformulation in a product space with reduced dimension ⋮ Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ Strict pseudocontractions and demicontractions, their properties, and applications ⋮ Strengthened splitting methods for computing resolvents ⋮ The circumcentered-reflection method achieves better rates than alternating projections ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ Multiscale Hierarchical Image Decomposition and Refinements: Qualitative and Quantitative Results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Iterative methods for fixed point problems in Hilbert spaces
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- 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
- A convergent relaxation of the Douglas-Rachford algorithm
- Algorithms based on unions of nonexpansive maps
- The Douglas-Rachford algorithm for the case of the sphere and the line
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Circumcentering the Douglas-Rachford method
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres
- Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm
- A feasibility approach for constructing combinatorial designs of circulant type
- An alternating projection that does not converge in norm
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- A cyclic Douglas-Rachford iteration scheme
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
- On the Douglas-Rachford algorithm
- Union averaged operators with applications to proximal algorithms for MIN-convex functions
- The Douglas-Rachford algorithm for a hyperplane and a doubleton
- Global convergence of a non-convex Douglas-Rachford iteration
- On the local convergence of the Douglas-Rachford algorithm
- Asymptotic behavior of contractions in Hilbert space
- New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses
- Linear convergence of the Douglas–Rachford method for two closed sets
- The Douglas–Rachford Algorithm in the Absence of Convexity
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- On Weak Convergence of the Douglas–Rachford Method
- APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Proximity Maps for Convex Sets
- Projection methods: an annotated bibliography of books and reviews
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Decomposition through formalization in a product space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
- The Complexity of Bit Retrieval
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Norm convergence of realistic projection and reflection methods
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
- Searching with iterated maps
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
- New Demiclosedness Principles for (Firmly) Nonexpansive Operators
- Functional Operators (AM-22), Volume 2
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
This page was built for publication: The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
