Preprint
Jul 2026
Implicit Primal-Dual Guarantees in Unconstrained First-Order Minimization
It is shown that any first-order method guaranteeing a bound on the primal objective gap f(x_N)-f(x_\star) assuming only a bound on $\|x_0-x_\star\|$ actually has a stronger guarantee on an explicit, computable primal-dual gap at the same rate.
Benjamin Grimmer, Alex L. Wang
· 0 citations