A successive centralized circumcenter reflection method for the convex feasibility problem

Abstract: In this paper we present the successive centralization of the circumcenter reflection scheme with several control sequences for solving the convex feasibility problem in Euclidean space. Assuming that a standard error bound holds, we prove the linear convergence of the method with the most violated constraint control sequence. Under additional smoothness assumptions, we prove the superlinear convergence. Numerical experiments confirm the efficiency of our method.