On the centralization of the circumcentered-reflection method

• Published in: Mathematical programming Vol. 205; no. 1-2; pp. 337 - 371
• Main Authors: Behling, Roger, Bello-Cruz, Yunier, Iusem, Alfredo N., Santos, Luiz-Rafael
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2024; Springer; Springer Nature B.V
• Subjects: Algorithms; Calculus of Variations and Optimal Control; Optimization; Combinatorics; Convergence; Convexity; Customer relationship management software; Full Length Paper; Mathematical and Computational Physics; Mathematical Methods in Physics; Mathematics; Mathematics and Statistics; Mathematics of Computing; Methods; Numerical Analysis; Theoretical; 65B99; Convex feasibility problem; 65K05; 90C25; Circumcentered-reflection method; Projection methods; 49M27
• ISSN: 0025-5610; 1436-4646
• DOI: 10.1007/s10107-023-01978-w

This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed convex sets. We introduce a so-called centralized version of the circumcentered-reflection method (CRM). Developed with the aim of accelerating classical projection algorithms, CRM is successful for tracking a common point of a finite number of affine sets. In the case of general convex sets, CRM was shown to possibly diverge if Pierra’s product space reformulation is not used. In this work, we prove that there exists an easily reachable region consisting of what we refer to as centralized points, where pure circumcenter steps possess properties yielding convergence. The resulting algorithm is called centralized CRM (cCRM). In addition to having global convergence, cCRM converges linearly under an error bound condition, and superlinearly if the two target sets are so that their intersection have nonempty interior and their boundaries are locally differentiable manifolds. We also run numerical experiments with successful results.