Relaxed Centralized Circumcentered-Reflection Methods for Convex Feasibility: Convergence and Finite Termination
Abstract
Projection methods are among the most widely used techniques for solving convex feasibility problems due to their simplicity and robustness. However, classical projection-based algorithms and existing circumcentered-reflection methods generally provide only asymptotic convergence. In this paper, we introduce a relaxed version of the centralized circumcentered-reflection method (cCRM) obtained through an extrapolation of the circumcenter step. We first analyze the two-set case and then extend the proposed approach to the successive framework for multiple convex sets, including under- and over-relaxation and a backtracking strategy. The convergence analysis establishes Fejér monotonicity and global convergence under suitable conditions, while local error-bound assumptions yield linear convergence and standard regularity assumptions imply superlinear convergence. Motivated by finitely convergent projection methods based on perturbed feasible sets, we further investigate a perturbed relaxed formulation designed to achieve finite termination. Numerical experiments show good practical performance, comparable to and competitive with the finitely convergent PACA method. The results also provide clear numerical evidence of finite termination in the tested instances.
Related
- Sharp hypocoercive convergence estimates for underdamped Langevin dynamics with specular reflection
- Proof of Stake economy under centralized exchanges--a mean field model
- Centralized Fault-Location and PMU Placement Strategies in Weakly Observable Grids: A Comprehensive Review
- Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
- Centralized Multi-Objective UAV–UGV Task Allocation for Disaster Relief Material Distribution with Mobile UAV Bases
BibTeX
@misc{guigues2026relaxed,
title = {{Relaxed Centralized Circumcentered-Reflection Methods for Convex Feasibility: Convergence and Finite Termination}},
author = {Vincent Guigues and Roger Behling and Adriana Henarejos},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.13713},
eprint = {2610.13713},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.13713},
}
RIS
TY - UNPB
TI - Relaxed Centralized Circumcentered-Reflection Methods for Convex Feasibility: Convergence and Finite Termination
AU - Vincent Guigues
AU - Roger Behling
AU - Adriana Henarejos
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2610.13713
UR - https://arxiv.org/abs/2610.13713
AB - Projection methods are among the most widely used techniques for solving convex feasibility problems due to their simplicity and robustness. However, classical projection-based algorithms and existing circumcentered-reflection methods generally provide only asymptotic convergence. In this paper, we introduce a relaxed version of the centralized circumcentered-reflection method (cCRM) obtained through an extrapolation of the circumcenter step. We first analyze the two-set case and then extend the proposed approach to the successive framework for multiple convex sets, including under- and over-relaxation and a backtracking strategy. The convergence analysis establishes Fejér monotonicity and global convergence under suitable conditions, while local error-bound assumptions yield linear convergence and standard regularity assumptions imply superlinear convergence. Motivated by finitely convergent projection methods based on perturbed feasible sets, we further investigate a perturbed relaxed formulation designed to achieve finite termination. Numerical experiments show good practical performance, comparable to and competitive with the finitely convergent PACA method. The results also provide clear numerical evidence of finite termination in the tested instances.
ER -