Lyapunov Analysis of Nesterov's AG

• The paper demonstrates that Lyapunov analysis provides explicit contraction factors ensuring global R-linear convergence for Nesterov's Accelerated Gradient in μ-strongly convex, L-smooth settings.
• It introduces a discrete Lyapunov sequence that tightly couples function error and state dynamics, enabling precise control over algorithmic contraction rates.
• The analysis extends to accelerated proximal gradient methods and contrasts discrete NAG behavior with continuous ODE models, highlighting the need for high-resolution corrections.

Nesterov's Accelerated Gradient (NAG) method is a foundational extrapolation-based algorithm for convex optimization. Lyapunov analysis has emerged as the central tool for certifying both accelerated and linear convergence rates of NAG—including in circumstances where the strong convexity parameter is unknown. Such analyses systematically relate the decrease of structural “energy” sequences to convergence guarantees, revealing delicate distinctions between algorithmic, continuous-time, and high/low-resolution dynamical perspectives.

1. Algorithmic Framework and Extrapolation Parameters

Nesterov's method in the context of $\mu$-strongly convex and $L$-smooth $f:\mathbb{R}^n\to\mathbb{R}$ operates through coupled updates:

• $x_{k+1} = y_k - s \nabla f(y_k)$,
• $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$,
• $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$,

where $s\in(0,1/L]$ and $t_k$ is a sequence satisfying $t_1 = 1$, $t_{k+1}^2 - t_{k+1} \leq t_k^2$, $L$0, $L$1. Standard (classical) NAG chooses $L$2 independent of $L$3, recovering optimal accelerated rates for convex objectives but leaving the case of strong convexity with $L$4 unknown unaddressed for Q- or R-linear convergence (Bao et al., 2023).

2. Lyapunov Construction in Discrete-time NAG

For any $L$5, define the discrete Lyapunov sequence:

• $L$6, where
• $L$7 (potential component),
• $L$8 (mixed/kinetic component).

This choice has the property $L$9 if and only if $f:\mathbb{R}^n\to\mathbb{R}$0 and $f:\mathbb{R}^n\to\mathbb{R}$1. It tightly links the function error and the coupled system state, and is specifically constructed to allow for sharp contraction estimates (Bao et al., 2023).

3. Linear (Q-linear) Contraction and Global R-linear Convergence

By leveraging $f:\mathbb{R}^n\to\mathbb{R}$2-smoothness and $f:\mathbb{R}^n\to\mathbb{R}$3-strong convexity, the Lyapunov difference at iteration $f:\mathbb{R}^n\to\mathbb{R}$4 satisfies: $f:\mathbb{R}^n\to\mathbb{R}$5 Simultaneous upper bounds and careful coefficient matching yield

$f:\mathbb{R}^n\to\mathbb{R}$6

for explicit, bounded sequences $f:\mathbb{R}^n\to\mathbb{R}$7, from which

$f:\mathbb{R}^n\to\mathbb{R}$8

with $f:\mathbb{R}^n\to\mathbb{R}$9 depending only on $x_{k+1} = y_k - s \nabla f(y_k)$0 and founded on the explicit form: $x_{k+1} = y_k - s \nabla f(y_k)$1 This proves Q-linear contraction of $x_{k+1} = y_k - s \nabla f(y_k)$2 and, by the structure of $x_{k+1} = y_k - s \nabla f(y_k)$3, yields global R-linear convergence: $x_{k+1} = y_k - s \nabla f(y_k)$4 For $x_{k+1} = y_k - s \nabla f(y_k)$5, the Lyapunov can be reduced to a classical two-term form $x_{k+1} = y_k - s \nabla f(y_k)$6, with $x_{k+1} = y_k - s \nabla f(y_k)$7 chosen optimally, and geometric decrease $x_{k+1} = y_k - s \nabla f(y_k)$8 established, unrolling to $x_{k+1} = y_k - s \nabla f(y_k)$9 (Bao et al., 2023).

4. Extension to Accelerated Proximal Gradient Methods

For composite objectives $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$0, with $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$1 closed and convex, define the proximal-gradient mapping $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$2. The accelerated proximal gradient (APG) update replaces $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$3 with $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$4 in the same NAG iteration. The Lyapunov-based analysis extends identically: $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$5 for $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$6, or $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$7 for $\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$8 (Bao et al., 2023).

5. Continuous-Time ODE Comparison and High-Resolution Effects

The classical low-resolution ODE,

$\beta_{k+1} = \frac{t_{k+1}-1}{t_{k+2}}$9

yields only $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$0 sublinear convergence, even for quadratics, with no possibility of exponential decay; $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$1 as $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$2. Thus, the discrete NAG method exhibits R-linear convergence without requiring $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$3 in $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$4, but this is impossible for the standard ODE limit (Bao et al., 2023). This discrepancy arises because the low-resolution ODE omits key $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$5 correction terms essential for exponential decay in discrete NAG.

High-resolution ODEs (Shi–Du–Jordan–Su) restore $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$6-scale terms, e.g.,

$y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$7

and locally, linear decay in objective is recovered, but global exponential decay remains unresolved in the continuous perspective (Bao et al., 2023).

6. Broader Significance: Uniform Q-Linear Theory with Unknown $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$8

The Lyapunov-based contraction and convergence theorems conclusively demonstrate that standard NAG, with classical extrapolation parameters and $y_{k+1} = x_{k+1} + \beta_{k+1} (x_{k+1} - x_k)$9 unknown, achieves global R-linear convergence on all $s\in(0,1/L]$0-strongly convex, $s\in(0,1/L]$1-smooth $s\in(0,1/L]$2 (Bao et al., 2023). The result is robust under any allowed sequence $s\in(0,1/L]$3 with $s\in(0,1/L]$4, $s\in(0,1/L]$5, $s\in(0,1/L]$6, $s\in(0,1/L]$7. For $s\in(0,1/L]$8, explicit and uniform bounds are provided for the contraction factors. This refines and expands the understanding of NAG's parameter robustness in practice and highlights a critical, previously unresolved, regime.

The analysis highlights the inapplicability of the continuous-time low-resolution ODE theory for capturing exponential-type contraction without $s\in(0,1/L]$9 correction. The Lyapunov framework further enables direct extension of R-linear convergence to composite proximal settings (e.g., APG/FISTA), even when problem structure or parameter knowledge is incomplete.

7. Summary Table: Key Results

Property	Low-Resolution ODE	Discrete NAG (unknown $t_k$0)	High-Resolution ODE (local)
Convergence type	$t_k$1 sublinear	Global R-linear (Q-linear Lyapunov)	Local linear decay
Parameter requirement	$t_k$2 for exponential rate	$t_k$3-independent $t_k$4 (classical)	$t_k$5 correction in ODE
Applicability to APG/FISTA	No	Yes (identical Lyapunov contraction)	Local only

The crucial insight is that the Lyapunov discrete analysis, not the ODE continuous-time intuition, accurately predicts and certifies the true algorithmic exponential convergence regime for strongly convex Nesterov's methods without explicit knowledge of $t_k$6 (Bao et al., 2023).