The Douglas-Rachford algorithm in the affine-convex case
From MaRDI portal
Publication:1790199
DOI10.1016/j.orl.2016.03.010zbMath1408.90231arXiv1505.06408OpenAlexW2951407603MaRDI QIDQ1790199
Heinz H. Bauschke, Walaa M. Moursi, Minh N. Dao
Publication date: 2 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.06408
convex feasibility problemDouglas-Rachford splitting operatorleast-squares solutionSpingarn's method
Related Items (14)
Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ On the minimal displacement vector of the Douglas-Rachford operator ⋮ On the linear convergence of the circumcentered-reflection method ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization ⋮ 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 ⋮ Infeasibility detection in the alternating direction method of multipliers for convex optimization ⋮ On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint ⋮ Linear Convergence of Projection Algorithms ⋮ A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the order of the operators in the Douglas-Rachford algorithm
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Partial inverse of a monotone operator
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Dykstra's alternating projection algorithm for two sets
- A fast dual proximal gradient algorithm for convex minimization and applications
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- On Weak Convergence of the Douglas–Rachford Method
- 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
- Minimization of unsmooth functionals
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: The Douglas-Rachford algorithm in the affine-convex case
