Choose
so the smooth maximum error is at most and the Lipschitz gradient constant is
Suppose a minimizer of lies within distance of the starting point. The Nesterov accelerated gradient method can find such that
in
iterations. If minimizes , then the smoothing inequalities imply
This improves the nonsmooth subgradient method dependence from to .

Articles by others on the same topic (0)

There are currently no matching articles.