Chooseso the smooth maximum error is at most and the Lipschitz gradient constant isSuppose a minimizer of lies within distance of the starting point. The Nesterov accelerated gradient method can find such thatiniterations. If minimizes , then the smoothing inequalities implyThis improves the nonsmooth subgradient method dependence from to .
Articles by others on the same topic
There are currently no matching articles.