Universal intermediate gradient method for convex problems with inexact oracle. (2nd November 2021)

• Record Type: Journal Article
• Authors: Kamzolov, Dmitry; Dvurechensky, Pavel; Gasnikov, Alexander V.
• Is Part Of: Optimization methods and software. Volume 36:Number 6(2021)
• Page Start: 1289
• Page End: 1316
• Publication Date: 2021-11-02
• Subjects: Convex optimization -- first-order methods -- inexact oracle -- intermediate gradient methods -- complexity bounds; 90C25 -- 90C47 -- 90C60; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2019.1711079
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : In this paper, we propose new first-order methods for minimization of a convex function on a simple convex set. We assume that the objective function is a composite function given as a sum of a simple convex function and a convex function with inexact Hölder-continuous subgradient. We propose Universal Intermediate Gradient Method. Our method enjoys both the universality and intermediateness properties. Following the ideas of Nesterov (Math. Program. 152 (2015), pp. 381–404) on Universal Gradient Methods, our method does not require any information about the Hölder parameter and constant and adjusts itself automatically to the local level of smoothness. On the other hand, in the spirit of the Intermediate Gradient Method proposed by Devolder et al. (CORE Discussion Paper 2013/17, 2013), our method is intermediate in the sense that it interpolates between Universal Gradient Method and Universal Fast Gradient Method. This allows to balance the rate of convergence of the method and rate of the oracle error accumulation. Under the additional assumption of strong convexity of the objective, we show how the restart technique can be used to obtain an algorithm with faster rate of convergence.