Pages that link to "Item:Q721957"
From MaRDI portal
The following pages link to A convergent relaxation of the Douglas-Rachford algorithm (Q721957):
Displaying 17 items.
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232) (← links)
- A class of problems for which cyclic relaxation converges linearly (Q732240) (← links)
- Convergence of a randomized Douglas-Rachford method for linear system (Q827570) (← links)
- Convergence of relaxation algorithms by averaging (Q1105492) (← links)
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
- Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval (Q2027792) (← links)
- Constraint reduction reformulations for projection algorithms with applications to wavelet construction (Q2046564) (← links)
- Some new characterizations of intrinsic transversality in Hilbert spaces (Q2174919) (← links)
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
- On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization (Q2230792) (← links)
- New Douglas-Rachford algorithmic structures and their convergence analyses (Q2789608) (← links)
- The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces (Q2804207) (← links)
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint (Q4971015) (← links)
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons (Q5025784) (← links)
- Phase Retrieval with Sparse Phase Constraint (Q5027026) (← links)
- Projection methods for high numerical aperture phase retrieval (Q5860805) (← links)
- Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions (Q6043138) (← links)
