Accelerated Gradient Flow Convex
wc_accelerated_gradient_flow_convex(t; solver=Clarabel.Optimizer, verbose=true)Problem statement
Compute a PEPit worst-case guarantee for wc_accelerated_gradient_flow_convex.
Consider the convex minimization problem
\[f_\star \triangleq \min_x f(x),\]
where $f$ is convex.
Performance metric
This code computes a worst-case guarantee for an accelerated gradient flow. That is, it verifies the inequality
\[\frac{d}{dt}\mathcal{V}(X_t, t) \leqslant 0 ,\]
is valid, where $\mathcal{V}(X_t, t) = t^2(f(X_t) - f(x_\star)) + 2 \|(X_t - x_\star) + \frac{t}{2}\frac{d}{dt}X_t \|^2$, $X_t$ is the output of an accelerated gradient flow, and where $x_\star$ is the minimizer of $f$.
In short, for given values of $t$, it verifies $\frac{d}{dt}\mathcal{V}(X_t, t) \leqslant 0$.
Algorithm
For $t \geqslant 0$,
\[\frac{d^2}{dt^2}X_t + \frac{3}{t}\frac{d}{dt}X_t + \nabla f(X_t) = 0,\]
with some initialization $X_{0}\triangleq x_0$.
Theoretical guarantee
The following **tight** guarantee can be verified in [1, Section 2]:\[\frac{d}{dt}\mathcal{V}(X_t, t) \leqslant 0.\]
After integrating between $0$ and $T$,\[f(X_T) - f_\star \leqslant \frac{2}{T^2}\|x_0 - x_\star\|^2.\]
The detailed approach using PEPs is available in [2, Theorem 2.6].References
Arguments
t: time stepsolver: JuMP optimizer constructor used to solve the generated SDP.verbose: print example and solver progress information when true.
Returns
pepit_tau: worst-case valuetheoretical_tau: theoretical value
Julia usage
pepit_tau, theoretical_tau = wc_accelerated_gradient_flow_convex(3.4; solver=Clarabel.Optimizer, verbose=true)
## Returns approximately: (pepit_tau, theoretical_tau) = (-0.0, 0.0)