{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:27:28Z","timestamp":1772065648285,"version":"3.50.1"},"reference-count":76,"publisher":"Informa UK Limited","issue":"6","funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["18-71-10044"],"award-info":[{"award-number":["18-71-10044"]}],"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.2021.1924714","type":"journal-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T08:06:23Z","timestamp":1625817983000},"page":"1155-1201","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":41,"title":["Inexact model: a framework for optimization and variational inequalities"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9250-4438","authenticated-orcid":false,"given":"Fedor","family":"Stonyakin","sequence":"first","affiliation":[{"name":"V. Vernadsky Crimean Federal University, Simferopol, Republic of Crimea"},{"name":"Moscow Institute of Physics and Technology, Dolgoprudny, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4963-8227","authenticated-orcid":false,"given":"Alexander","family":"Tyurin","sequence":"additional","affiliation":[{"name":"National Research University Higher School of Economics, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Dolgoprudny, Russia"},{"name":"National Research University Higher School of Economics, Moscow, Russia"},{"name":"Institute for Information Transmission Problems, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1201-2343","authenticated-orcid":false,"given":"Pavel","family":"Dvurechensky","sequence":"additional","affiliation":[{"name":"National Research University Higher School of Economics, Moscow, Russia"},{"name":"Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9314-8634","authenticated-orcid":false,"given":"Artem","family":"Agafonov","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Dolgoprudny, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1757-1021","authenticated-orcid":false,"given":"Darina","family":"Dvinskikh","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Dolgoprudny, Russia"},{"name":"National Research University Higher School of Economics, Moscow, Russia"},{"name":"Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5470-0182","authenticated-orcid":false,"given":"Mohammad","family":"Alkousa","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Dolgoprudny, Russia"},{"name":"National Research University Higher School of Economics, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1208-1659","authenticated-orcid":false,"given":"Dmitry","family":"Pasechnyuk","sequence":"additional","affiliation":[{"name":"Moscow Institute of Physics and Technology, Dolgoprudny, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4063-7407","authenticated-orcid":false,"given":"Sergei","family":"Artamonov","sequence":"additional","affiliation":[{"name":"National Research University Higher School of Economics, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3640-5256","authenticated-orcid":false,"given":"Victorya","family":"Piskunova","sequence":"additional","affiliation":[{"name":"V. Vernadsky Crimean Federal University, Simferopol, Republic of Crimea"}]}],"member":"301","published-online":{"date-parts":[[2021,7,9]]},"reference":[{"key":"CIT0001","unstructured":"A. Anikin, P. Dvurechensky, A. Gasnikov, A. Golov, A. Gornov, Y. Maximov, M. Mendel, and V. Spokoiny, Modern efficient numerical approaches to regularized regression problems in application to traffic demands matrix calculation from link loads,\u00a0Proceedings of International Conference ITAS-2015, Russia, Sochi, Institute for Information Transmission Problems of Russian Academy of Science, 2015. Available at arXiv:1508.00858."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542517080048"},{"key":"CIT0003","unstructured":"K. Antonakopoulos, E.V. Belmega, and P. Mertikopoulos, Adaptive extra-gradient methods for min-max optimization and games, preprint (2020). Available at arXiv:2010.12100."},{"key":"CIT0004","unstructured":"K. Antonakopoulos, V. Belmega, and P. Mertikopoulos, An adaptive mirror-prox method for variational inequalities with singular operators, in Advances in Neural Information Processing Systems 32, H. Wallach, H. Larochelle, A. Beygelzimer, F. dAlch\u00e9 Buc, E. Fox, and R. Garnett, eds., Curran Associates, Inc.\u00a0Montreal, 2019, pp. 8455\u20138465."},{"key":"CIT0005","first-page":"21","volume":"59","author":"Baimurzina D.","year":"2019","journal-title":"J. Comput. Math. Math. Phys."},{"key":"CIT0006","first-page":"77","volume":"31","author":"Bao T.Q.","year":"2006","journal-title":"Acta Math. Vietnamica"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0817"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"CIT0009","unstructured":"L. Bogolubsky, P. Dvurechensky, A. Gasnikov, G. Gusev, Y. Nesterov, A.M. Raigorodskii, A. Tikhonov, and M. Zhukovskii, Learning supervised pagerank with gradient-based and gradient-free optimization methods, in Advances in Neural Information Processing Systems 29, D.D. Lee, M. Sugiyama, U.V. Luxburg, I. Guyon, and R. Garnett, eds., Curran Associates, Inc., Barcelona, 2016, pp. 4914\u20134922. Available at arXiv:1603.00717."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/0803026"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_31"},{"key":"CIT0013","unstructured":"M.B. Cohen, A. Sidford, and K. Tian, Relative lipschitzness in extragradient methods and a direct recipe for acceleration, Proceedings of the 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, 6\u20138 January 2021, Virtual Conference, J.R. Lee, ed., LIPIcs Vol. 185. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 2021, pp. 1\u201318. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2021.62."},{"key":"CIT0014","unstructured":"A. Defazio, A simple practical accelerated method for finite sums, in Advances in Neural Information Processing Systems, Curran Associates, Inc., Barcelona, 2016, pp. 676\u2013684."},{"key":"CIT0015","unstructured":"O. Devolder, F. Glineur, and Y. Nesterov, First-order methods with inexact oracle: the strongly convex case, CORE Discussion Papers 2013\/16 (2013)."},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"CIT0017","unstructured":"R.A. Dragomir, A. Taylor, A. d'Aspremont, and J. Bolte, Optimal complexity and certification of Bregman first-order methods, preprint (2019). Available at arXiv:1911.08510."},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01432-w"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029798"},{"key":"CIT0020","unstructured":"P. Dvurechensky, D. Dvinskikh, A. Gasnikov, C.A. Uribe, and A. Nedi\u0107, Decentralize and randomize: faster algorithm for Wasserstein barycenters, in Advances in Neural Information Processing Systems 31, NIPS'18, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, eds. Curran Associates, Inc., 2018, pp. 10783\u201310793. http:\/\/papers.nips.cc\/paper\/8274-decentralize-and-randomize-faster-algorithm-for-wasserstein-barycenters.pdf, arXiv:1802.04367."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0999-6"},{"key":"CIT0022","unstructured":"P. Dvurechensky, A. Gasnikov, E. Gasnikova, S. Matsievsky, A. Rodomanov, and I. Usik, Primal-dual method for searching equilibrium in hierarchical congestion population games, Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016) Vladivostok, Russia, 19\u201323 September 2016, CEUR Workshop Proceedings, pp. 584\u2013595. Available at arXiv:1606.08988."},{"key":"CIT0023","author":"Dvurechensky P.","year":"2019","journal-title":"Optim. Methods & Softw"},{"key":"CIT0024","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. 2018, PMLR, Stockholm, pp. 1367\u20131376. Available at arXiv:1802.04367."},{"key":"CIT0025","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, preprint (2017). Available at arXiv:1706.07622."},{"key":"CIT0026","unstructured":"P. Dvurechensky, A. Gasnikov, and A. Tiurin, Randomized similar triangles method: a unifying framework for accelerated randomized optimization methods (coordinate descent, directional search, derivative-free method), preprint (2017). Available at arXiv:1707.08486."},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"CIT0028","unstructured":"A. Gasnikov, Universal gradient descent, preprint (2017). Available at arXiv:1711.00394."},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562416020071"},{"key":"CIT0030","unstructured":"A. Gasnikov, P. Dvurechensky, E. Gorbunov, E. Vorontsova, D. Selikhanovych, C.A. Uribe, B. Jiang, H. Wang, S. Zhang, S. Bubeck, Q. Jiang, Y.T. Lee, Y. Li, and A. Sidford, Near optimal methods for minimizing convex functions with lipschitz p-th derivatives, Proceedings of the Thirty-Second Conference on Learning Theory, A. Beygelzimer and D. Hsu, eds., Proceedings of Machine Learning Research, PMLR, 2019, Vol. 99, Phoenix, USA, 25\u201328 June 2019, pp. 1392\u20131393. Available at http:\/\/proceedings.mlr.press\/v99\/gasnikov19b.html, arXiv:1809.00382."},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542519050075"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542518010050"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542519070078"},{"key":"CIT0034","unstructured":"E. Gorbunov, D. Dvinskikh, and A. Gasnikov, Optimal decentralized distributed algorithms for stochastic convex optimization, preprint (2019). Available at arXiv:1911.07363."},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562419020042"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0778-9"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1137\/17M1144799"},{"key":"CIT0038","unstructured":"M. Jaggi, Revisiting Frank-Wolfe: projection-free sparse convex optimization, in ICML (1), PMLR, Atlanta, 2013, pp. 427\u2013435."},{"key":"CIT0039","first-page":"50","volume":"61","author":"Konnov I.","year":"2017","journal-title":"Izvestija Vysshih Uchebnyh Zavedenij. Matematika"},{"key":"CIT0040","unstructured":"A. Kroshnin, N. Tupitsa, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and C. Uribe, On the complexity of approximating Wasserstein barycenters, in Proceedings of the 36th International Conference on Machine Learning, K. Chaudhuri and R. Salakhutdinov, eds., Proceedings of Machine Learning Research, PMLR, 2019, Vol. 97, 9\u201315 June, Long Beach, California, USA, 2019, pp. 3530\u20133540. Available at arXiv:1901.08686."},{"key":"CIT0041","unstructured":"A. Kulunchakov and J. Mairal, Estimate sequences for stochastic composite optimization: variance reduction, acceleration, and robustness to noise, preprint (2019). Available at arXiv:1901.08788."},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0737-x"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1137\/17M1157891"},{"key":"CIT0045","unstructured":"H. Lin, J. Mairal, and Z. Harchaoui, A universal catalyst for first-order optimization, Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS'15, Cambridge, MA, USA, MIT Press, 2015, pp. 3384\u20133392. Available at http:\/\/dl.acm.org\/citation.cfm?id=2969442.2969617."},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1137\/16M1099546"},{"key":"CIT0047","unstructured":"J. Mairal, Optimization with first-order surrogate functions, International Conference on Machine Learning, Proceedings of Machine Learning Research, PMRL, Atlanta, 2013, pp. 783\u2013791."},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1300899"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01416-w"},{"key":"CIT0050","first-page":"1244","volume":"3","author":"Mastroeni G.","year":"2000","journal-title":"Publicatione Del Departimento Di Mathematica Dell'Universita Di Pisa"},{"key":"CIT0051","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"CIT0052","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0427"},{"key":"CIT0053","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(85)90100-4"},{"key":"CIT0054","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"CIT0055","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"CIT0056","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0790-0"},{"key":"CIT0057","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1188-6"},{"key":"CIT0058","unstructured":"Y. Nesterov, Implementable tensor methods in unconstrained convex optimization, Tech. Rep., CORE UCL, 2018. Available at https:\/\/alfresco.uclouvain.be\/alfresco\/service\/guest\/streamDownload\/workspace\/SpacesStore\/aabc2323-0bc1-40d4-9653-1c29971e7bd8\/coredp2018_05web.pdf, CORE Discussion Paper 2018\/05."},{"key":"CIT0059","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"CIT0060","unstructured":"Y. Nesterov, Soft clustering by convex electoral model, CORE Discussion Papers 2018001, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE), 2018. https:\/\/ideas.repec.org\/p\/cor\/louvco\/2018001.html."},{"key":"CIT0061","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1858831"},{"key":"CIT0062","author":"Nesterov Y.","year":"2018","journal-title":"Optim. Methods. Softw."},{"key":"CIT0063","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"CIT0064","doi-asserted-by":"crossref","unstructured":"P. Ochs, J. Fadili, and T. Brox, Non-smooth non-convex Bregman minimization: unification and new algorithms, preprint (2017). Available at arXiv:1707.02278.","DOI":"10.1007\/s10957-018-01452-0"},{"key":"CIT0065","doi-asserted-by":"crossref","unstructured":"A. Ogaltsov, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and V. Spoloiny. On the line-search gradient methods for stochastic optimization, IFAC 2020 Congress, Berlin.\u00a0IFAC-PapersOnLine, Vol. 53, I. 2, 2020, pp. 1715\u20131720.","DOI":"10.1016\/j.ifacol.2020.12.2284"},{"key":"CIT0066","doi-asserted-by":"crossref","unstructured":"Y. Ouyang and Y. Xu, Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems, preprint (2018). Available at arXiv:1808.02901.","DOI":"10.1007\/s10107-019-01420-0"},{"key":"CIT0067","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"CIT0068","unstructured":"K. Scaman, F. Bach, S. Bubeck, Y.T. Lee, and L. Massouli\u00e9, Optimal algorithms for smooth and strongly convex distributed optimization in networks, Proceedings of the 34th International Conference on Machine Learning, PMLR, 2017, D. Precup and Y.W. Teh, eds., Proceedings of Machine Learning Research Vol. 70, 6\u201311 August, International Convention Centre, Sydney, Australia, pp. 3027\u20133036. Available at http:\/\/proceedings.mlr.press\/v70\/scaman17a.html."},{"key":"CIT0069","unstructured":"F. Stonyakin, A. Gasnikov, P. Dvurechensky, M. Alkousa, and A. Titov, Generalized Mirror\u2013Prox for monotone variational inequalities: universality and inexact oracle, preprint (2018). Available at arXiv:1806.05140."},{"key":"CIT0070","unstructured":"F. Stonyakin, A. Gasnikov, A. Tyurin, D. Pasechnyuk, A. Agafonov, P. Dvurechensky, D. Dvinskikh, A. Kroshnin, and V. Piskunova, Inexact model: a framework for optimization and variational inequalities, WIAS Preprint No. 2679, (2019). Available at arXiv:1902.00990."},{"key":"CIT0071","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22629-9_8"},{"key":"CIT0072","unstructured":"P. Tseng, On accelerated proximal gradient methods for convex-concave optimization, Tech. Rep., MIT, 2008. Available at http:\/\/www.mit.edu\/dimitrib\/PTseng\/papers\/apgm.pdf."},{"key":"CIT0073","unstructured":"A. Tyurin, Primal-dual fast gradient method with a model, preprint (2019). Available at arXiv:1906.10107."},{"key":"CIT0074","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619160"},{"key":"CIT0075","unstructured":"Y. Xie, X. Wang, R. Wang, and H. Zha, A fast proximal point method for Wasserstein distance, preprint (2018). Available at arXiv:1802.04307."},{"key":"CIT0076","unstructured":"R. Zhao and R.M. Freund, Analysis of the Frank-Wolfe method for logarithmically-homogeneous barriers, with an extension, preprint (2020). Available at arXiv:2010.08999."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2021.1924714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T01:17:35Z","timestamp":1664500655000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2021.1924714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,9]]},"references-count":76,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11,2]]}},"alternative-id":["10.1080\/10556788.2021.1924714"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2021.1924714","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,9]]},"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":"2020-01-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}