Pages that link to "Item:Q2274154"
From MaRDI portal
The following pages link to Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154):
Displaying 10 items.
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
- A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← 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)
- Strengthened splitting methods for computing resolvents (Q2231047) (← links)
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle (Q2252928) (← links)
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm (Q2420809) (← links)
- Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← 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)