Pages that link to "Item:Q2044486"

The following pages link to The circumcentered-reflection method achieves better rates than alternating projections (Q2044486):

Displayed 10 items.

• Circumcentering approximate reflections for solving the convex feasibility problem (Q2138461) ‎ (← links)
• Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) ‎ (← links)
• Bregman circumcenters: basic theory (Q2664902) ‎ (← links)
• Bregman circumcenters: monotonicity and forward weak convergence (Q2679003) ‎ (← links)
• Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections (Q5013582) ‎ (← links)
• (Q5091985) ‎ (← links)
• Circumcentric directions of cones (Q6043123) ‎ (← links)
• Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions (Q6043138) ‎ (← links)
• On the centralization of the circumcentered-reflection method (Q6126653) ‎ (← links)
• A successive centralized circumcentered-reflection method for the convex feasibility problem (Q6179873) ‎ (← links)