Мақаланы E-mail арқылы жіберу Accelerated Primal-Dual Gradient Descent with Linesearch for Convex, Nonconvex, and Nonsmooth Optimization Problems
- Авторлар: Guminov S.V.1, Nesterov Y.E.2,3, Dvurechensky P.E.4, Gasnikov A.V.1,4
-
Мекемелер:
- Moscow Institute of Physics and Technology
- Center for Operations Research and Econometrics (CORE), Catholic University of Louvain
- National Research University Higher School of Economics
- Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
- Шығарылым: Том 99, № 2 (2019)
- Беттер: 125-128
- Бөлім: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225638
- DOI: https://doi.org/10.1134/S1064562419020042
- ID: 225638
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
A new version of accelerated gradient descent is proposed. The method does not require any a priori information on the objective function, uses a linesearch procedure for convergence acceleration in practice, converge according to well-known lower bounds for both convex and nonconvex objective functions, and has primal-dual properties. A universal version of this method is also described.
Авторлар туралы
S. Guminov
Moscow Institute of Physics and Technology
Хат алмасуға жауапты Автор.
Email: sergey.guminov@phystech.edu
Ресей, Dolgoprudnyi, Moscow oblast, 141700
Yu. Nesterov
Center for Operations Research and Econometrics (CORE), Catholic University of Louvain; National Research University Higher School of Economics
Email: sergey.guminov@phystech.edu
Бельгия, Louvain-la-Neuve; Moscow, 101000
P. Dvurechensky
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Email: sergey.guminov@phystech.edu
Ресей, Moscow, 127051
A. Gasnikov
Moscow Institute of Physics and Technology; Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Email: sergey.guminov@phystech.edu
Ресей, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 127051
Қосымша файлдар
