{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:28:52Z","timestamp":1787498932064,"version":"build-2736575974"},"reference-count":39,"publisher":"Informa UK Limited","issue":"6","funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["17-11-01027"],"award-info":[{"award-number":["17-11-01027"]}],"id":[{"id":"10.13039\/501100006769","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,11,2]]},"DOI":"10.1080\/10556788.2019.1711079","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T03:21:06Z","timestamp":1579231266000},"page":"1289-1316","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":13,"title":["Universal intermediate gradient method for convex problems with inexact oracle"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8488-9692","authenticated-orcid":false,"given":"Dmitry","family":"Kamzolov","sequence":"first","affiliation":[{"name":"Moscow Institute of Physics and Technology, 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":"Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany"},{"name":"Institute for Information Transmission Problems RAS, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"Alexander V.","family":"Gasnikov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Moscow, Russia"},{"name":"Institute for Information Transmission Problems RAS, Moscow, Russia"},{"name":"National Research University Higher School of Economics, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542517080048"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542519010020"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499354564"},{"key":"CIT0004","unstructured":"A. Ben-Tal and A. Nemirovski,\n                      Lectures on modern convex optimization (Lecture notes)\n                      , Personal web-page of A. Nemirovski, 2015. Available at http:\/\/www2.isye.gatech.edu\/nemirovs\/Lect_ModConvOpt.pdf."},{"key":"CIT0005","unstructured":"L. Bogolubsky, P. Dvurechensky, A. Gasnikov, G. Gusev, Y. Nesterov, A.M. Raigorodskii, A. Tikhonov, and M. Zhukovskii,\n                      Learning supervised pagerank with gradient-based and gradient-free optimization methods\n                      , in\n                      Advances in Neural Information Processing Systems 29\n                      , D.D. Lee, M. Sugiyama, U.V. Luxburg, I. Guyon, and R. Garnett, eds., Curran Associates, Inc., Barcelona, 2016, pp. 4914\u20134922, arXiv:1603.00717."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_31"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1137\/060676386"},{"key":"CIT0008","unstructured":"O. Devolder, F. Glineur, and Y. Nesterov,\n                      Intermediate gradient methods for smooth convex problems with inexact oracle\n                      (2013), CORE Discussion Paper 2013\/17."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0999-6"},{"key":"CIT0011","unstructured":"P. Dvurechensky, A. Gasnikov, and A. Kroshnin,\n                      Computational optimal transport: complexity by accelerated gradient descent is better than by Sinkhorn's algorithm\n                      , Stockholm, Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 80, arXiv:1802.04367, 2018, pp. 1367\u20131376."},{"key":"CIT0012","unstructured":"P. Dvurechensky, A. Gasnikov, E. Gasnikova, S. Matsievsky, A. Rodomanov, and I. Usik,\n                      Primal-dual method for searching equilibrium in hierarchical congestion population games\n                      , Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016) Vladivostok, Russia, September 19\u201323, 2016, arXiv:1606.08988, 2016, pp. 584\u2013595."},{"key":"CIT0013","unstructured":"P. Dvurechensky, A. Gasnikov, S. Omelchenko, and A. Tiurin,\n                      Adaptive similar triangles method: a stable alternative to sinkhorn's algorithm for regularized optimal transport\n                      , preprint arXiv:1706.07622 (2017)."},{"key":"CIT0014","unstructured":"P. Dvurechensky, D. Dvinskikh, A. Gasnikov, C.A. Uribe, and A. Nedi\u0107,\n                      Decentralize and randomize: faster algorithm for wasserstein barycenters\n                      , in\n                      Advances in Neural Information Processing Systems 31\n                      , NeurIPS 2018, arXiv:1806.03915, Curran Associates, Inc., 2018, pp. 10783\u201310793."},{"key":"CIT0015","unstructured":"O. Fercoq and Z. Qu,\n                      Restarting accelerated gradient methods with a rough strong convexity estimate\n                      , preprint arXiv:1609.07358 (2016)."},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drz007"},{"key":"CIT0017","unstructured":"A. Gasnikov, P. Dvurechensky, and D. Kamzolov,\n                      Gradient and gradient-free methods for stochastic convex optimization with inexact oracle\n                      , Dynamics systems and control processes. Proceedings of the International Conference Dedicated to the 90th Anniversary of the Birth of Academic N. N. Krasovsky. (2015), pp. 111\u2013117. Available at https:\/\/arxiv.org\/abs\/1502.06259."},{"key":"CIT0018","first-page":"41","volume":"8","author":"Gasnikov A.","year":"2016","journal-title":"Proc. Moscow Inst. Phys. Technol."},{"key":"CIT0019","first-page":"25","volume":"8","author":"Gasnikov A.","year":"2016","journal-title":"TRUDY MIPT"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542518010050"},{"key":"CIT0021","first-page":"143","volume":"7","author":"Gasnikov A.","year":"2015","journal-title":"TRUDY MIPT"},{"key":"CIT0022","unstructured":"A. Gasnikov, S. Kabanikhin, A. Mohamed, and M. Shishlenin,\n                      Convex optimization in Hilbert space with applications to inverse problems\n                      , preprint arXiv:1703.00267 (2017)."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562416020071"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542519070078"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-019-00915-4"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562419020042"},{"key":"CIT0027","unstructured":"N. He, Z. Harchaoui, Y. Wang, and L. Song,\n                      Fast and simple optimization for poisson likelihood models\n                      , preprint arXiv:1608.01264 (2016)."},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1287\/10-SSY010"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(85)90100-4"},{"key":"CIT0031","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky A.","year":"1983"},{"key":"CIT0032","unstructured":"Y. Nesterov,\n                      A method for unconstrained convex minimization problem with the rate of convergence  O(1\/k2)\n                      , in\n                      Doklady AN USSR\n                      , Vol. 269, 1983, pp. 543\u2013547."},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0790-0"},{"key":"CIT0035","unstructured":"A. Ogaltsov, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and V. Spokoiny,\n                      Adaptive gradient descent for convex and non-convex stochastic optimization\n                      , arXiv:1911.08380 (2019)."},{"key":"CIT0036","unstructured":"V. Roulet and A. d'Aspremont,\n                      Sharpness, restart and acceleration\n                      , in\n                      Advances in Neural Information Processing Systems\n                      , 2017, pp. 1119\u20131129."},{"key":"CIT0037","unstructured":"F. Stonyakin, A. Gasnikov, A. Tyurin, D. Pasechnyuk, A. Agafonov, P. Dvurechensky, D. Dvinskikh, A. Kroshnin, and V. Piskunova,\n                      Inexact model: a framework for optimization and variational inequalities\n                      , arXiv:1902.00990 (2019)."},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22629-9_8"},{"key":"CIT0039","unstructured":"A. Yurtsever, Q. Tran-Dinh, and V. Cevher,\n                      A universal primal-dual convex optimization framework\n                      , Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS'15, Montreal, Canada, MIT Press, Cambridge, MA, USA, 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.2019.1711079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T21:17:48Z","timestamp":1664486268000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1711079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,17]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11,2]]}},"alternative-id":["10.1080\/10556788.2019.1711079"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1711079","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,17]]},"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":"2017-12-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}