Skip to content
Preprint

The Sharp Worst-Case Asymptotic Rate of the Barzilai--Borwein Method in $\mathbb R^d$ and Hilbert Spaces

Aug 2026 · 1 citation · ⚡ 1 influential
Mathematics Computer Science

Abstract

We establish sharp asymptotic rates for the two Barzilai--Borwein (BB) rules on uniformly positive quadratics and local nonlinear problems. In finite dimensions, for either fixed rule and an arbitrary positive first step, the gradient root factor is bounded by $(b_0-a_0)/(b_0+a_0)$, where $[a_0,b_0]$ is the initially active spectral interval. Hence the worst trajectory factor is $c_H=(\kappa(H)-1)/(\kappa(H)+1)$. When $H$ has at least two distinct eigenvalues, matched initialization and a balanced endpoint trajectory attain this value. Under matched initialization, the same constant is the optimal uniform-envelope threshold. For bounded, self-adjoint, uniformly positive operators on Hilbert space, scalar spectral measures yield the corresponding active-support bound and optimal matched uniform-envelope threshold, including continuous endpoint spectrum. Finally, if the gradient is strictly Fr\'echet differentiable at a stationary point and its derivative is self-adjoint and uniformly positive, every $\gamma\in(c_*,1)$, where $c_*=(\kappa(A_*)-1)/(\kappa(A_*)+1)$, is a uniform local envelope rate for either pure BB rule. Every well-defined trajectory converging to the stationary point has error and gradient root factors at most $c_*$ and objective-gap root factor at most $c_*^2$. Over the class of objectives with prescribed distinct derivative endpoints $m_*

View source

Similar papers

Preprint Jul 2026

Barzilai-Borwein Fails Superlinear Convergence on an Open Set of Quadratics for Every Dimension $n\geq 4$

Barzilai--Borwein (BB) method has shown strong practical performance in continuous optimization, yet its convergence dynamics remains poorly understood. In particular, a central unresolved question is whether BB converges superlinearly for almost every strictly convex quadratic problem and initialization. We provide a...

Dawei Li, Xiaotian Jiang, Mingyi Hong · 0 citations
Preprint Aug 2026

One-Dimensional Divergence-Type Jacobi Operators Driven by The Doubling Map

We study one-dimensional Jacobi operators of divergence-gradient type on $\ell^2(\mathbb{Z}_{\geq 0})$, with coefficients generated by the doubling map, $a_n(x)=a(2^n x \mathrm{mod} 1)$. For continuous positive sampling functions, we show that the almost-sure essential spectrum is an interval containing the bottom of t...

Long Li, Wei Wang, Shi-Wen Zhang · 0 citations
Preprint Aug 2026

Fully nonlinear parabolic equations under a fixed reference diffusion:weighted $L^2$ Hessian estimates and well-posedness

We develop a fixed-reference weighted $L^2$ theory for terminal-value fully nonlinear parabolic equations. A prescribed uniformly elliptic diffusion starting from a point determines both the linear reference operator and a space--time occupation measure; time weights of order $\alpha$ accommodate the point-start singul...

Jihao Long, Zhenhu Zhao · 0 citations
Preprint Aug 2026

Second Hankel Determinant for $\beta$-Spirallike Convex Mappings in Complex Banach Spaces

We establish the bound for the second-order Hankel determinant $H_{2,2}(F) = A_2 A_4 - A_3^2$ associated with the class $\mathcal{C}_{B}^{\beta}(\mathbb{B})$ of normalized $\beta$-spirallike quasi-convex mappings of type $B$ on the open unit ball $\mathbb{B}$ of a complex Banach space. By utilizing a generalized framew...

M. B. Ahamed, Nabadwip Sarkar, Pradip Das · 0 citations
Preprint Aug 2026

Open-Loop Riemannian Frank--Wolfe: Fast Rates under Error Bounds and Scaling Inequalities

We explore fast convergence of the Riemannian Frank--Wolfe method for smooth geodesically convex optimization over compact feasible sets. Hadamard manifolds are the main setting. On general complete manifolds, the analysis accounts for all feasible minimizing geodesics. We consider the open loop step-size $\eta_k=a/(k+...

Kang-Ming Chen · 1 citation · ⚡1
Preprint Aug 2026

Optimal near-optimality bounds for the Lanczos method for matrix functions

Let $A$ be Hermitian positive definite and let $f_m$ denote the Lanczos approximation to $f(A)b$. We prove that if $f(z)$ or $f(z) / z$ is Stieltjes, then the $A^\alpha$-norm error of the Lanczos approximation is within a factor $\tfrac{1}{2}(\kappa(A)^{E/2} + \kappa(A)^{-E/2})$ of the the best possible Krylov Subspace...

Tyler Chen, David Persson · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.