{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T13:27:25Z","timestamp":1790774845317,"version":"4.1.0"},"reference-count":31,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["18-71-10108"],"award-info":[{"award-number":["18-71-10108"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-29-03071 mk"],"award-info":[{"award-number":["18-29-03071 mk"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-31-20005 mol_a_ved"],"award-info":[{"award-number":["18-31-20005 mol_a_ved"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,7,4]]},"DOI":"10.1080\/10556788.2020.1731747","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T10:52:25Z","timestamp":1583146345000},"page":"773-810","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":22,"title":["Primal\u2013dual accelerated gradient methods with small-dimensional relaxation oracle"],"prefix":"10.1080","volume":"36","author":[{"given":"Yurii","family":"Nesterov","sequence":"first","affiliation":[{"name":"Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (UCL), Louvain-la-Neuve, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[{"name":"National Research University Higher School of Economics, Moscow, Russia"},{"name":"Moscow Institute of Physics and Technology, 2191Dolgoprudny, Russia"},{"name":"Institute for Information Transmission Problems RAS, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0009-0344","authenticated-orcid":false,"given":"Sergey","family":"Guminov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, 2191Dolgoprudny, Russia"},{"name":"Institute for Information Transmission Problems RAS, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1201-2343","authenticated-orcid":false,"given":"Pavel","family":"Dvurechensky","sequence":"additional","affiliation":[{"name":"Institute for Information Transmission Problems RAS, Moscow, Russia"},{"name":"Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2020,3,2]]},"reference":[{"key":"CIT0001","unstructured":"Z. Allen-Zhu and L. Orecchia, Linear coupling: An ultimate unification of gradient and mirror descent, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017."},{"key":"CIT0002","unstructured":"N. Andrei, 40 conjugate gradient algorithms for unconstrained optimization. A survey on their definition, (2008). Available at https:\/\/camo.ici.ro\/neculai\/p13a08.pdf."},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.10.007"},{"key":"CIT0005","unstructured":"A. Ben-Tal and A. Nemirovski, Lectures on modern convex optimization (lecture notes), Personal web-page of A. Nemirovski, 2015. Available at http:\/\/www2.isye.gatech.edu\/nemirovs\/Lect_ModConvOpt.pdf."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_31"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-1087-4"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01410-2"},{"key":"CIT0009","unstructured":"P. Dvurechensky, A. Gasnikov, and A. Kroshnin, Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn's algorithm, in Proceedings of the 35th International Conference on Machine Learning, J. Dy and A. Krause, eds., Proceedings of Machine Learning Research, Vol. 80, Stockholmsm\u00e4ssan, Stockholm, Sweden, July 10\u201315, 2018, pp. 1367\u20131376. Available at http:\/\/proceedings.mlr.press\/."},{"key":"CIT0010","unstructured":"P. Dvurechensky, A. Gasnikov, S. Omelchenko, and A. Tiurin, Adaptive similar triangles method: A stable alternative to Sinkhorn's algorithm for regularized optimal transport, (2017). Available at arXiv:1706.07622."},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-019-00915-4"},{"key":"CIT0013","unstructured":"S. Guminov and A. Gasnikov, Accelerated methods for \u03b1-weakly-quasi-convex problems, (2017). Available at arXiv preprint arXiv:1710.00797."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2018.1517158"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1080\/10556780410001689225"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1137\/17M112124X"},{"key":"CIT0017","unstructured":"G. Narkiss and M. Zibulevsky, Sequential subspace optimization method for large-scale unconstrained problems, Technion-IIT, Department of Electrical Engineering, 2005."},{"key":"CIT0018","first-page":"937","volume":"2","author":"Nemirovski A.","year":"1982","journal-title":"Izvestia AN SSSR, Transl.: Eng. Cybern. Soviet J. Comput. Syst. Sci."},{"key":"CIT0019","first-page":"88","volume":"1","author":"Nemirovski A.","year":"1983","journal-title":"Izvestia AN SSSR, Transl.: Eng. Cybern. Soviet J. Comput. Syst. Sci."},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(92)90013-2"},{"key":"CIT0021","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky A.","year":"1983"},{"key":"CIT0022","volume-title":"Effective Methods in Nonlinear Programming","author":"Nesterov Y.E.","year":"1989"},{"key":"CIT0023","first-page":"372","volume":"27","author":"Nesterov Y.","year":"1983","journal-title":"Soviet Math. Doklady"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"CIT0025","doi-asserted-by":"crossref","unstructured":"Y. Nesterov, Introductory lectures on convex optimization, Appl. Optim. 87 (2004), pp. 58\u201362.","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"CIT0027","first-page":"10","volume":"88","author":"Nesterov Y.","year":"2012","journal-title":"Optima"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0790-0"},{"key":"CIT0030","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006","edition":"2"},{"key":"CIT0031","unstructured":"A. Yurtsever, Q. Tran-Dinh, and V. Cevher, A universal primal\u2013dual convex optimization framework, in Proceedings of the 28th International Conference on Neural Information Processing Systems, MIT Press, Cambridge, MA, USA, NIPS'15, 2015, pp. 3150\u20133158."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1731747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T12:13:29Z","timestamp":1662380009000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1731747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,2]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7,4]]}},"alternative-id":["10.1080\/10556788.2020.1731747"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1731747","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-01-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}