13 citations · 21 across the 3 of their papers we have counts for
3 papers · 1 filter
A circumcentered-reflection method for finding common fixed points of firmly nonexpansive operators
Reza Arefidamghani, Roger Behling, Alfredo N. Iusem +1
The circumcentered-reflection method (CRM) has been recently proposed as a methodology for accelerating several algorithms for solving the Convex Feasibility Problem (CFP), equival…
Circumcentering approximate reflections for solving the convex feasibility problem
Guilherme Araújo, Reza Arefidamghani, Roger Behling +3
The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with…
The circumcentered-reflection method achieves better rates than alternating projections
Reza Arefidamghani, Roger Behling, Yunier Bello-Cruz +2
We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method of Alternating Projections (MA…