A Shift-Operator Proof of Strong Convergence for Boţ–Nguyen Acceleration

Bauschke and Gao conjectured that the Boţ–Nguyen accelerated iteration associated with any linearnonexpansive operator on a real Hilbert space converges strongly for every parameter α > 2. Their proofat α = 4 proceeded through a Lorentz condition for universal weighted-mean coefficients. We prove thefull conjecture by applying the already known fixed-point residual estimate to one operator: the unilateralright shift on ℓ2. The shift places the universal coefficients in distinct orthogonal coordinates, and a singleCauchy–Schwarz inequality gives the stronger quantitative bound TV (cn) = o(n−1/2). We state a reusableshift criterion and provide reproducible 80-digit Python computations checking the coefficient recurrenceand its residual identity. These finite computations supplement rather than replace the proof.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-28
DOI
https://doi.org/10.5281/zenodo.23734453
Primary Topic
Optimization and Variational Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A Shift-Operator Proof of Strong Convergence for Boţ–Nguyen Acceleration

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Optimization and Variational Analysis
preprint

A Shift-Operator Proof of Strong Convergence for Boţ–Nguyen Acceleration

Tony Newton
preprint en

Abstract

Bauschke and Gao conjectured that the Boţ–Nguyen accelerated iteration associated with any linearnonexpansive operator on a real Hilbert space converges strongly for every parameter α > 2. Their proofat α = 4 proceeded through a Lorentz condition for universal weighted-mean coefficients. We prove thefull conjecture by applying the already known fixed-point residual estimate to one operator: the unilateralright shift on ℓ2. The shift places the universal coefficients in distinct orthogonal coordinates, and a singleCauchy–Schwarz inequality gives the stronger quantitative bound TV (cn) = o(n−1/2). We state a reusableshift criterion and provide reproducible 80-digit Python computations checking the coefficient recurrenceand its residual identity. These finite computations supplement rather than replace the proof.

Zenodo (CERN European Organization for Nuclear Research)
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon