Pages that link to "Item:Q2814277"
From MaRDI portal
The following pages link to Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study (Q2814277):
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)
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← 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 circumcentered-reflection method achieves better rates than alternating projections (Q2044486) (← links)
- Convergence analysis of two-step inertial Douglas-Rachford algorithm and application (Q2142498) (← links)
- Extremality, stationarity and generalized separation of collections of sets (Q2315263) (← links)
- The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
- On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems (Q2954171) (← links)
- How good are the proximal point algorithms? (Q3777808) (← links)
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility (Q4579457) (← links)
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
- Linear Convergence of Projection Algorithms (Q5219736) (← links)
- Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators (Q5242929) (← links)
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping (Q5501199) (← links)
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces (Q5737718) (← links)
