Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2021, Volume 61, Number 1, Pages 20–31
DOI: https://doi.org/10.31857/S0044466921010051 (Mi zvmmf11181) 		 
This article is cited in 13 scientific papers (total in 13 papers)

Optimal control

Accelerated meta-algorithm for convex optimization problems

A. V. Gasnikovab, D. M. Dvinskikhabc, P. E. Dvurechenskiibc, D. Kamzolova, V. V. Matyukhina, D. A. Pasechnyuka, N. K. Tupitsaa, A. V. Chernova

a Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
b Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
c Weierstrass institute for Applied Analysis and Stochastics
Citations (13)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S0044466921010051
Abstract: An envelope called an accelerated meta-algorithm is proposed. Based on the envelope, accelerated methods for solving convex unconstrained minimization problems in various formulations can be obtained from nonaccelerated versions in a unified manner. Quasi-optimal algorithms for minimizing smooth functions with Lipschitz continuous derivatives of arbitrary order and for solving smooth minimax problems are given as applications. The proposed envelope is more general than existing ones. Moreover, better convergence estimates can be obtained in the case of this envelope and better efficiency can be achieved in practice for a number of problem formulations.
Key words: convex optimization, accelerated proximal method, tensor methods, inexact oracle, sliding, catalyst.
Funding agency Grant number
Russian Foundation for Basic Research 18-31-20005 мол_а_вед
19-31-90170 Аспиранты
18-29-03071 мк
Ministry of Education and Science of the Russian Federation 075-00337-20-03
The work by A. Gasnikov (Section 2) was supported by the Russian Foundation for Basic Research (project no. 18-31-20005 mol_a_ved), Kamzolov’s work (Section 3) was supported by the Russian Foundation for Basic Research (project no. 19-31-90170 Aspiranty), and Dvurechensky’s work (Section 3) was supported by the Russian Foundation for Basic Research (project no. 18-29-03071 mk). Dvinskikh and Matyukhin acknowledge the support of the Ministry of Science and Higher Education of the Russian Federation, state assignment no. 075-00337-20-03, project no. 0714-2020-0005.
Received: 18.04.2020
Revised: 16.06.2020
Accepted: 18.09.2020
English version:
Computational Mathematics and Mathematical Physics, 2021, Volume 61, Issue 1, Pages 17–28
DOI: https://doi.org/10.1134/S096554252101005X
Bibliographic databases:
Document Type: Article
UDC: 519.853.62
Language: Russian
Citation: A. V. Gasnikov, D. M. Dvinskikh, P. E. Dvurechenskii, D. Kamzolov, V. V. Matyukhin, D. A. Pasechnyuk, N. K. Tupitsa, A. V. Chernov, “Accelerated meta-algorithm for convex optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 61:1 (2021), 20–31; Comput. Math. Math. Phys., 61:1 (2021), 17–28
Citation in format AMSBIB
\Bibitem{GasDviDvu21}
\by A.~V.~Gasnikov, D.~M.~Dvinskikh, P.~E.~Dvurechenskii, D.~Kamzolov, V.~V.~Matyukhin, D.~A.~Pasechnyuk, N.~K.~Tupitsa, A.~V.~Chernov
\paper Accelerated meta-algorithm for convex optimization problems
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2021
\vol 61
\issue 1
\pages 20--31
\mathnet{http://mi.mathnet.ru/zvmmf11181}
\crossref{https://doi.org/10.31857/S0044466921010051}
\elib{https://elibrary.ru/item.asp?id=44428903}
\transl
\jour Comput. Math. Math. Phys.
\yr 2021
\vol 61
\issue 1
\pages 17--28
\crossref{https://doi.org/10.1134/S096554252101005X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000624061700002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85101687880}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf11181
  • https://www.mathnet.ru/eng/zvmmf/v61/i1/p20
    • This publication is cited in the following 13 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Statistics & downloads:
    Abstract page:132
    References:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024