Primal-dual accelerated gradient descent with line search for convex and nonconvex optimization problems
Sergey Vladimirovich Guminov, Yu. E. Nesterov, Pavel Dvurechensky, Alexander Vladimirovich Gasnikov · Доклады Академии наук · 2019
In this paper a new variant of accelerated gradient descent is proposed. The proposed method does not require any information about the objective function, uses exact line search for the practical accelerations of convergence, converges according to the well-known lower bounds for both convex and non-convex objective functions and possesses primal-dual properties. We also provide a universal version of said method, which converges according to the known lower bounds for both smooth and non-smooth problems.