  We show that Nesterov acceleration is an optimal-order iterative
regularization method for linear ill-posed problems provided that a parameter
is chosen accordingly to the smoothness of the solution. This result is proven
both for an a priori stopping rule and for the discrepancy principle. The
essential tool to obtain this result is a representation of the residual
polynomials via Gegenbauer polynomials.
