---
title: Extended Centralized Circumcentered Reflection (ecCRM)
url: https://www.emergentmind.com/topics/extended-centralized-circumcentered-reflection-method-eccrm
type: topic
---

# Extended Centralized Circumcentered Reflection (ecCRM)

The Extended Centralized Circumcentered Reflection Method (ecCRM) is a general framework for accelerated feasibility algorithms in convex and affine settings that unifies and extends several earlier projection–reflection schemes. It replaces the fixed centralization step of the classical centralized CRM (cCRM) with a modular centralization operator and a relaxation parameter, providing tunable control over per-iteration complexity and convergence dynamics. EcCRM retains global convergence, achieves linear rates under error bound regularity, and under smoothness or vanishing step sizes exhibits provably superlinear acceleration. The method's versatility and performance are demonstrated both theoretically and through extensive large-scale numerical experimentation [2512.05324].

## 1. Mathematical Foundation and Problem Setting

EcCRM operates primarily on two-set convex feasibility problems:
\[
\text{find } z\in X\cap Y,\qquad X,Y\subset\mathbb R^n\text{ closed, convex},\ X\cap Y\neq\emptyset.
\]
Classical projection–reflection schemes such as alternating projections, Douglas–Rachford, and Cimmino are generally limited to linear convergence under regularity assumptions. The circumentered-reflection method (CRM) improved this by achieving superlinear convergence in certain cases, specifically under smooth boundary conditions.

The generalization to ecCRM introduces an admissible centralization operator $T:\mathbb R^n\to Y$ (with $\operatorname{Im}T\subset Y$ and $\|Tz-s\|\le\|z-s\|$ for all $s\in X\cap Y$), and a relaxation parameter $\alpha\in(0,1)$:
\[
N^\alpha z \;=\; \alpha\, T(z) + (1-\alpha) \, P_X(T(z)).
\]
The ecCRM update step is then defined as:
\[
z_{k+1} = \mathrm{circ}\bigl(w,\;2v-w,\;2u-w\bigr)
\]
where $w=N^\alpha(z_k)$, $v=P_X(T(z_k))$, and $u=P_Y(w)$.

Common choices for $T$ include:
- $T=P_Y$ (three projections per step)
- $T=P_Y P_X$ (four projections, coinciding with cCRM)
- $T=P_Y P_X P_Y$ (five projections, "deep" kernel)

This modularity enables trade-offs between contraction strength and computational expense per iteration [2512.05324].

## 2. Algorithmic Structure and Implementation

A typical iteration of ecCRM consists of:
- Application of the kernel $T$ to the current iterate.
- Projection onto $X$ from $T(z_k)$.
- Formation of a centralized point via convex combination governed by $\alpha$.
- Projection/reflection onto $Y$ and $X$.
- Circumcenter computation for the three points derived above.

### ecCRM Pseudocode (Two-set Case)

```python
# Inputs: initial point z0, admissible operator T, sequence (alpha_k), tolerance eps
z = z0
k = 0
while max(dist(z, X), dist(z, Y)) > eps:
    t = T(z)
    x = P_X(t)
    w = alpha_k * t + (1 - alpha_k) * x
    u = P_Y(w)
    v = x
    z_new = circumcenter(w, 2*v - w, 2*u - w)
    z = z_new
    k += 1
return z
```
Each iteration comprises one $T$-application, two projections, two reflections, and a three-point affine circumcenter computation.

Extensions exist for multi-set feasibility problems, firm nonexpansive operator intersections, and affine subspace contexts, adapting the centralization and circumcenter computation accordingly [1711.08651, 2203.02410, 1912.01063].

## 3. Convergence Theory

### Global Convergence

Assuming $S = X \cap Y \neq \emptyset$, the ecCRM sequence $(z_k)$ is Fejér monotone with respect to $S$ and converges to a point in $S$ for any admissible $T$ and any sequence $(\alpha_k) \subset (0,1)$. The algorithm does not require strict regularity or Slater-type assumptions for convergence [2512.05324].

### Linear Convergence Rate

Suppose a local error bound holds in the form
\[
\omega\, \operatorname{dist}(z, S) \leq \max \{ \operatorname{dist}(z, X), \operatorname{dist}(z, Y) \}, \quad \omega \in (0, 1).
\]
For $\bar \alpha = \limsup \alpha_k$, ecCRM achieves Q-linear convergence with rate
\[
\rho = \beta( \bar\alpha + (1 - \bar\alpha)\beta ) < 1, \quad \beta = \sqrt{1 - \omega^2}
\]
and the improvement in each step is quantified:
\[
\operatorname{dist}(z_{k+1}, S) \leq \rho\, \operatorname{dist}(z_k, S).
\]
This holds for convex sets, finite intersections of affine subspaces, and products of firmly nonexpansive operators [2203.02410, 1711.08651].

### Superlinear Convergence

If $\partial X$ and $\partial Y$ are $C^1$-smooth and intersect transversally, and either every centralized point $w_k$ is strictly centralized or $\alpha_k \to 0$, ecCRM achieves superlinear convergence:
\[
\frac{\operatorname{dist}(z_{k+1}, S)}{\operatorname{dist}(z_k, S)} \to 0
\]
as $k \to \infty$. A vanishing schedule $\alpha_k \to 0$ ensures superlinearity even if strict centralization fails [2512.05324, 2212.06911].

## 4. Centralization, Kernel Choice, and Step Size Effects

Selecting the kernel $T$ and relaxation parameter $\alpha$ determines the balance:
- "Deeper" kernels ($T$ involves more projections/reflections) yield stronger contractions and accelerate convergence, at higher computational cost.
- Shallower kernels (e.g., $T=P_Y$) achieve cheaper steps but slower shrinkage of the feasibility gap per iteration.
- Fixed $\alpha \approx 0.5$ typically balances centralization and step length.
- Smaller $\alpha$ increases centralization, supporting superlinear convergence but may reduce movement per iteration.
- Vanishing schedules $\alpha_k \to 0$ accelerate convergence in nearly tangent or smooth manifold settings [2512.05324, 2212.06911].

## 5. Applications and Comparative Numerical Performance

EcCRM is applicable wherever two-set feasibility or intersection problems appear:
- Matrix and tensor completion (e.g., PSD completion, rank constraints)
- Image reconstruction
- Signal recovery
- Intersection of high-dimensional geometric sets (ellipsoids, subspaces)
- Fixed-point problems for firmly nonexpansive operators
- Primal–dual and ADMM-type splitting in optimization contexts [2512.05324, 2001.10784, 2203.02410]

In matrix completion with $n=100$ and rank 5:
- Deep kernel ecCRM ($T = P_Y P_X P_Y$) at $\alpha \approx 0.5$ reduced total runtime and iteration count by roughly 9% compared to cCRM, despite extra projections.

In intersections of high-dimensional ellipsoids $(\mathbb{R}^{2000})$:
- Vanishing step sizes $(\alpha_k = 1/(k+2))$ in ecCRM reduced iterations by $\sim$15% and runtime by $\sim$20% versus fixed-$\alpha$ cCRM at tight tolerances ($10^{-12}$).

Tests on random intersections of multiple sets demonstrated ecCRM can use orders of magnitude fewer projections than sequential or product-space methods, with efficiency gains increasing in higher dimensions and larger set cardinalities [2212.06911, 2203.02410].

## 6. Relationship to Prior and Alternative Feasibility Schemes

EcCRM strictly generalizes cCRM and is compatible with various operator contexts, including affine isometries [1912.01063], convex combinations of projections, classical alternated projections (MAP), Douglas–Rachford, and even primal–dual schemes via iterated operator application [2512.05324, 2001.10784].

The circumcenter operator provides the closest point to the intersection among affine combinations of reflection trajectories, yielding contraction factors that can match or improve upon those for classical methods. The centralization operator—either as a fixed projection or via kernel composition—suppresses zig-zagging and accelerates convergence in practice.

EcCRM inherits or improves upon the convergence rate of the underlying kernel, and its modular structure allows practitioners to tune projections and contractions to computational resources and problem geometry. Convex combinations and centralization steps are shown formally to preserve nonexpansiveness and monotonicity required for convergence [2203.02410].

## 7. Summary Table: Key Algorithmic and Theoretical Elements

| Component         | ecCRM Feature                                               | Implications            |
|-------------------|------------------------------------------------------------|-------------------------|
| Centralization    | Modular operator $T$ and parameter $\alpha$                | Tunable contraction/cost|
| Kernel choices    | $T=P_Y,\;P_Y P_X,\;P_Y P_X P_Y$                            | Depth–rate trade-off    |
| Convergence       | Global (Fejér monotonicity), linear (error bound), superlinear (smoothness/vanishing $\alpha$) | Robust across regimes   |
| Complexity        | $(|T|+2)$ projections, 2 reflections, one circ per iteration| Scalable                |
| Applicability     | Convex/affine sets, fixed-point problems, primal–dual      | Versatile algorithm     |

The extended centralized circumcentered reflection method constitutes a modular, accelerated baseline for projection–reflection schemes applicable to a variety of feasibility, fixed-point, and optimization problems. Its analysis unifies and extends earlier convergence guarantees and demonstrates robust empirical efficacy on high-dimensional and large-scale instances [2512.05324, 1711.08651, 2203.02410, 2212.06911].

Source: https://www.emergentmind.com/topics/extended-centralized-circumcentered-reflection-method-eccrm