Backend






On the sharp linear convergence rate of the circumcentered--reflection method on subspaces
arXiv cs.NA0 views
arXiv:2606.07888v3 Announce Type: replace-cross Abstract: For two subspaces $U,V\subseteq\RR^n$, the circumcentered--reflection method (CRM) of Behling, Bello-Cruz, and Santos~\citeyearpar{BBS2018} computes the projection onto $U\cap V$ using only the reflections across $U$ and $V$, with known linear-convergence rate equal to the cosine of the Friedrichs angle. We prove that, when CRM is initialized in $V$, it contracts at the strictly smaller rate $\rho_V=(\sin^2\theta_p-\sin^2\theta_F)/(\sin^2\theta_p+\sin^2\theta_F)$, where $\theta_F\in(0,\pi/2]$ is the Friedrichs angle, whose cosine we denote by $c_F\coloneqq\cos\theta_F$, and $\theta_p\in[\theta_F,\pi/2]$ is the largest principal angle between $U$ and $V$. The bound is sharp, attained on an explicit ray in $V$, and optimal among parameter-free single-step iterations. The constant itself is not new: Bauschke, Bello-Cruz, Nghia, Phan, and Wang~\citeyearpar{BBNPW2016} identified it as the optimal rate of the relaxed alternating-projection family and of their adaptive linesearch map $B_T$. Our contribution is that the parameter-free geometric circumcenter attains it as well, via Kantorovich's inequality applied to a single self-adjoint operator on $V$. Restricted to $V$, CRM coincides pointwise with the linesearch maps $A_T$ and $B_T$ from the Gubin--Polyak--Raik framework~\citep{GPR1967}. We further prove $\rho_VSource:https://arxiv.org/abs/2606.07888
PreviousQuantum Gibbs sampling through the detectability lemmaNextDirect Numerical Simulation of Thermoacoustically Unstable Flames Via Non-Drifting Acoustic Delay Characteristic Boundary Conditions
Related posts
Your analytics export says more than you think (if you read it honestly)
0dev.to OpenSource
Tencent LoopForge: Turn Coding Agents Into Repeatable Software Delivery
0dev.to OpenSource
Your agent does not need more tools. It needs a checkpoint.
0dev.to OpenSource
NVIDIA SkillEvaluator 1.0.1: Test Agent Skills Before Shipping Them
0dev.to OpenSource
I routed Claude Code tasks to cheaper models. Here's what 15 requests saved. published: true tags: claudecode, ai, opensource, productivity
0dev.to OpenSource
Who Owns the Code AI Wrote?
0dev.to Programming
show = false, 2600)"
x-show="show" x-cloak x-transition.opacity.duration.200ms
class="fixed bottom-8 left-1/2 z-[80] -translate-x-1/2 rounded-lg border border-line bg-card px-4 py-2.5 text-sm text-heading shadow-card-hover"
role="status" aria-live="polite">