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.

References in corpus (7)

• On the Circumcentered-Reflection Method for the Convex Feasibility Problem
• The circumcentered-reflection method achieves better rates than alternating projections
• Infeasibility and error bound imply finite convergence of alternating projections
• Convergence analysis under consistent error bounds
• Circumcentering approximate reflections for solving the convex feasibility problem
• On the centralization of the circumcentered-reflection method
• Circumcentric directions of cones