Contracting Proximal Methods for Smooth Convex Optimization

Abstract

In this paper, we propose new accelerated methods for smooth convex optimization, called contracting proximal methods. At every step of these methods, we need to minimize a contracted version of the objective function augmented by a regularization term in the form of Bregman divergence. We provide global convergence analysis for a general scheme admitting inexactness in solving the auxiliary subproblem. In the case of using for this purpose high-order tensor methods, we demonstrate an acceleration effect for both convex and uniformly convex composite objective functions. Thus, our construction explains acceleration for methods of any order starting from one. The augmentation of the number of calls of oracle due to computing the contracted proximal steps is limited by the logarithmic factor in the worst-case complexity bound.

Cited by in corpus (7)

• Accelerated meta-algorithm for convex optimization
• Near-Optimal Hyperfast Second-Order Method for convex optimization and its Sliding
• Inexact Tensor Methods with Dynamic Accuracies
• Optimization Methods for Fully Composite Problems
• Smoothing fast iterative hard thresholding algorithm for ${\ell }_0$ regularized nonsmooth convex regression problem
• Accelerated Proximal Envelopes: Application to the Coordinate Descent Method
• Convex optimization