Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions.

In this paper we study the convergence properties of a Nesterov's family of inertial schemes which is a specific case of inertial Gradient Descent algorithm in the context of a smooth convex minimization problem, under some additional hypotheses on the local geometry of the objective function F, such as the growth (or Łojasiewicz) condition. In particular we study the different convergence rates for the objective function and the local variation, depending on these geometric conditions. In this setting we can give optimal convergence rates for this Nesterov scheme. Our analysis shows that there are some situations when Nesterov's family of inertial schemes is asymptotically less efficient than the gradient descent (e.g. in the case when the objective function is quadratic). [ABSTRACT FROM AUTHOR]