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


Zh. Vychisl. Mat. Mat. Fiz., 2020, Volume 60, Number 11, Pages 1843–1866 (Mi zvmmf11157)  

This article is cited in 1 scientific paper (total in 1 paper)

Optimal control

Accelerated methods for saddle-point problem

M. S. Alkousaab, A. V. Gasnikovabc, D. M. Dvinskikhcd, D. A. Kovaleve, F. S. Stonyakinf

a Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
b National Research University "Higher School of Economics", Moscow
c Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
d Weierstrass Institute for Applied Analysis and Stochastics, Berlin
e King Abdullah University of Science and Technology
f Crimea Federal University, Simferopol

Abstract: Recently, it has been shown how, on the basis of the usual accelerated gradient method for solving problems of smooth convex optimization, accelerated methods for more complex problems (with a structure) and problems that are solved using various local information about the behavior of a function (stochastic gradient, Hessian, etc.) can be obtained. The term “accelerated methods” here means, on the one hand, the presence of some unified and fairly general way of acceleration. On the other hand, this also means the optimality of the methods, which can often be proved rigorously. In the present work, an attempt is made to construct in the same way a theory of accelerated methods for solving smooth convex-concave saddle-point problems with a structure. The main result of this article is the obtainment of in some sense necessary and sufficient conditions under which the complexity of solving nonlinear convex-concave saddle-point problems with a structure in the number of calculations of the gradients of composites in direct variables is equal in order of magnitude to the complexity of solving bilinear problems with a structure.

Key words: saddle problem, accelerated method, sliding, prox-friendly function.

Funding Agency Grant Number
Ministry of Education and Science of the Russian Federation 5-100
Russian Foundation for Basic Research 18-31-20005 мол-а-вед
Ministry of Science and Higher Education of the Russian Federation МК-15.2020.1
The research in Sections 1 and 2 was carried out within the Program of Fundamental Research of the National Research University Higher School of Economics and was supported by the program of the state support of the leading universities of the Russian Federation “5-100”. The research in Section 3 was supported by the Russian Foundation for Basic Research (project no. 18-31-20005 mol-a-ved) and, in Section 4, by the Russian Science Foundation (project no. 18-71-10108). The reach in Appendix 1 and partially Appendix 2 were supported by a Russian Federation Presidential grant for the state support of young Russian scientists: candidates of sciences (grant no. MK-15.2020.1).


DOI: https://doi.org/10.31857/S0044466920110022


English version:
Computational Mathematics and Mathematical Physics, 2020, 60:11, 1787–1809

Bibliographic databases:

UDC: 519.624
Received: 01.12.2019
Revised: 20.12.2019
Accepted:07.07.2020

Citation: M. S. Alkousa, A. V. Gasnikov, D. M. Dvinskikh, D. A. Kovalev, F. S. Stonyakin, “Accelerated methods for saddle-point problem”, Zh. Vychisl. Mat. Mat. Fiz., 60:11 (2020), 1843–1866; Comput. Math. Math. Phys., 60:11 (2020), 1787–1809

Citation in format AMSBIB
\Bibitem{AlkGasDvi20}
\by M.~S.~Alkousa, A.~V.~Gasnikov, D.~M.~Dvinskikh, D.~A.~Kovalev, F.~S.~Stonyakin
\paper Accelerated methods for saddle-point problem
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2020
\vol 60
\issue 11
\pages 1843--1866
\mathnet{http://mi.mathnet.ru/zvmmf11157}
\crossref{https://doi.org/10.31857/S0044466920110022}
\elib{https://elibrary.ru/item.asp?id=44038904}
\transl
\jour Comput. Math. Math. Phys.
\yr 2020
\vol 60
\issue 11
\pages 1787--1809
\crossref{https://doi.org/10.1134/S0965542520110020}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=WOS:000596808500005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85097277766}


Linking options:
  • http://mi.mathnet.ru/eng/zvmmf11157
  • http://mi.mathnet.ru/eng/zvmmf/v60/i11/p1843

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. L. Gladin, M. Alkusa, A. V. Gasnikov, “O reshenii vypuklykh min-min zadach s gladkostyu i silnoi vypuklostyu po odnoi iz grupp peremennykh i maloi razmernostyu drugoi”, Avtomat. i telemekh., 2021, no. 10, 60–75  mathnet  crossref
  • Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Number of views:
    This page:27

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021