Pages that link to "Item:Q288232"
From MaRDI portal
The following pages link to On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232):
Displaying 11 items.
- On the order of the operators in the Douglas-Rachford algorithm (Q279805) (← links)
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting (Q670659) (← links)
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
- The Douglas-Rachford algorithm in the affine-convex case (Q1790199) (← links)
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580) (← links)
- Finitely convergent iterative methods with overrelaxations revisited (Q2239369) (← links)
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
- The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem (Q2836088) (← links)
- Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)
- Linear Convergence of Projection Algorithms (Q5219736) (← links)
