|
This article is cited in 17 scientific papers (total in 17 papers)
Fast gradient descent for convex minimization problems with an oracle producing a $(\delta,L)$-model of function at the requested point
A. V. Gasnikovabc, A. I. Turina a State University – Higher School of Economics, Moscow, 125319 Russia
b Moscow Institute of Physics and Technology, Dolgoprudnyi, Moscow oblast, 141700 Russia
c Kharkevich Institute for Information Transmission Problems, Moscow, 127051 Russia
Abstract:
A new concept of $(\delta,L)$ -model of a function that is a generalization of the Devolder–Glineur–Nesterov $(\delta,L)$-oracle is proposed. Within this concept, the gradient descent and fast gradient descent methods are constructed and it is shown that constructs of many known methods (composite methods, level methods, conditional gradient and proximal methods) are particular cases of the methods proposed in this paper.
Key words:
gradient descent, fast gradient descent, model of function, universal method, conditional gradient method, composite optimization.
Received: 08.11.2017 Revised: 08.11.2017 Accepted: 11.03.2019
Citation:
A. V. Gasnikov, A. I. Turin, “Fast gradient descent for convex minimization problems with an oracle producing a $(\delta,L)$-model of function at the requested point”, Zh. Vychisl. Mat. Mat. Fiz., 59:7 (2019), 1137–1150; Comput. Math. Math. Phys., 59:7 (2019), 1085–1097
Linking options:
https://www.mathnet.ru/eng/zvmmf10921 https://www.mathnet.ru/eng/zvmmf/v59/i7/p1137
|
Statistics & downloads: |
Abstract page: | 250 | References: | 25 |
|