Accelerated GRAAL¶
Implements Accelerated GRAAL, a parameter-free accelerated gradient method that fuses Nesterov coupling with the Golden Ratio adaptive line search.
The method runs a GRAAL-style explicit gradient step whose step size \(\eta_k\) is set automatically from a local curvature estimate (a Bregman-to-gradient-gap ratio), so no Lipschitz constant or learning rate is tuned. Around that step it layers a Nesterov-type acceleration: a GRAAL extrapolated point is coupled with an averaged sequence, and the coupling weights \(\alpha_k, \beta_k\) adapt to the accumulated step sizes \(H_k = \sum_i \eta_i\). This yields the optimal accelerated convergence rate for smooth convex problems while remaining fully adaptive.
where \(\theta,\gamma,\nu>0\) satisfy \(4\nu\theta(1+\gamma)^2=\gamma\), the curvature ratio is \(\Lambda(x;z)=2 B_f(x;z)/\lVert\nabla f(x)-\nabla f(z)\rVert^2\) (and \(+\infty\) when \(\nabla f(x)=\nabla f(z)\)) with Bregman divergence \(B_f(x;z)=f(x)-f(z)-\langle\nabla f(z),\,x-z\rangle\), \(H_k=\sum_{i\le k}\eta_i\) is the accumulated step size, \(\bar{x}_k\) is the returned averaged iterate, and the recursion is initialized by \(\alpha_0=\beta_0=1\), \(H_0=H_{-1}=\eta_{-1}=\eta_0\), \(\tilde{x}_0=\bar{x}_0=x_0\).
Reference: Ekaterina Borodich, Dmitry Kovalev, "Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization", arXiv 2025. https://arxiv.org/abs/2507.09823