Pages that link to "Item:Q312177"
From MaRDI portal
The following pages link to Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177):
Displaying 17 items.
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
- Circumcentering the Douglas-Rachford method (Q1652791) (← links)
- Tight global linear convergence rate bounds for Douglas-Rachford splitting (Q1684840) (← links)
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence (Q1739044) (← links)
- The circumcentered-reflection method achieves better rates than alternating projections (Q2044486) (← links)
- Error bounds for the method of simultaneous projections with infinitely many subspaces (Q2054274) (← links)
- The block-wise circumcentered-reflection method (Q2191785) (← links)
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154) (← links)
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
- The optimal error bound for the method of simultaneous projections (Q2406901) (← links)
- On the linear convergence of the circumcentered-reflection method (Q2417091) (← links)
- On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
- Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem (Q2679568) (← links)
- Polynomial estimates for the method of cyclic projections in Hilbert spaces (Q6076936) (← links)
- Comparing the methods of alternating and simultaneous projections for two subspaces (Q6146685) (← links)
- The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection (Q6158002) (← links)
- A successive centralized circumcentered-reflection method for the convex feasibility problem (Q6179873) (← links)