  We propose an accelerated meta-algorithm, which allows to obtain accelerated
methods for convex unconstrained minimization in different settings. As an
application of the general scheme we propose nearly optimal methods for
minimizing smooth functions with Lipschitz derivatives of an arbitrary order,
as well as for smooth minimax optimization problems. The proposed
meta-algorithm is more general than the ones in the literature and allows to
obtain better convergence rates and practical performance in several settings.
