{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:43:48Z","timestamp":1775018628695,"version":"3.50.1"},"reference-count":36,"publisher":"Pleiades Publishing Ltd","issue":"6","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1134\/s036176882306004x","type":"journal-article","created":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T07:02:57Z","timestamp":1701414177000},"page":"513-524","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Accelerated Coordinate Descent Methods for Searching Equilibria in Two-Stage Transportation Equilibrium Traffic Flow Distribution Model"],"prefix":"10.1134","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6090-6469","authenticated-orcid":false,"given":"N. A.","family":"Il\u2019tyakov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6195-1848","authenticated-orcid":false,"given":"M. A.","family":"Obozov","sequence":"additional","affiliation":[]},{"given":"I. M.","family":"Dyshlevski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1912-1040","authenticated-orcid":false,"given":"D. V.","family":"Yarmoshik","sequence":"additional","affiliation":[]},{"given":"M. B.","family":"Kubentaeva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"A. V.","family":"Gasnikov","sequence":"additional","affiliation":[]},{"given":"E. V.","family":"Gasnikova","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"3766_CR1","volume-title":"Modelling Transport","author":"J.D. Ort\u00fazar","year":"2002","unstructured":"Ort\u00fazar, J.D. and Willumsen, L.G., Modelling Transport, West Sussex, England: Wiley and Sons, 2002)."},{"key":"3766_CR2","volume-title":"Transportation Network Analysis","author":"S.D. Boyles","year":"2020","unstructured":"Boyles, S.D., Lownes, N.E., and Unnikrishnan, A., Transportation Network Analysis, Vol. I: Static and Dynamic Traffic Assignment, 2020."},{"key":"3766_CR3","volume-title":"Models of Equilibrium Distribution of Flows in Large Networks","author":"A.V. Gasnikov","year":"2023","unstructured":"Gasnikov, A.V. and Gasnikova, E.V., Models of Equilibrium Distribution of Flows in Large Networks, Moscow: URSS, 2023."},{"key":"3766_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0041-1647(76)90100-3","volume":"10","author":"S.P. Evans","year":"1976","unstructured":"Evans, S.P., Derivation and analysis of some models for combining trip distribution and assignment, Transp. Res., 1976, vol. 10, no. 1, pp. 37\u201357.","journal-title":"Transp. Res."},{"key":"3766_CR5","first-page":"34","volume":"26","author":"A.V. Gasnikov","year":"2014","unstructured":"Gasnikov, A.V. et al., On the three-stage version of stable dynamic model, Mat. Model., 2014, vol. 26, no. 6, pp. 34\u201370.","journal-title":"Mat. Model."},{"key":"3766_CR6","doi-asserted-by":"publisher","first-page":"858","DOI":"10.3390\/math11040858","volume":"11","author":"E. Gasnikova","year":"2023","unstructured":"Gasnikova, E. et al., An evolutionary view on equilibrium models of transport flows, Mathematics, 2023, vol.\u00a011, no. 4, pp. 858.","journal-title":"Mathematics"},{"key":"3766_CR7","first-page":"365","volume":"13","author":"E.V. Kotlyarova","year":"2021","unstructured":"Kotlyarova, E.V. et al., Finding Equilibriums in two-stage models of tranportation flow distribution over a network, Komput. Issled. Model., 2021, vol. 13, no. 2, pp. 365\u2013379.","journal-title":"Komput. Issled. Model."},{"key":"3766_CR8","unstructured":"Kubentaeva, M. et al., Primal-Dual Gradient Methods for Searching Network Equilibria in Combined Models with Nested Choice Structure and Capacity Constraints. arXive:2307.00427."},{"key":"3766_CR9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/16M1060182","volume":"27","author":"Y. Nesterov","year":"2017","unstructured":"Nesterov, Y. and Stich, S., Efficiency of the accelerated coordinate descent method on structured optimization problems, SIAM J. Optim., 2017, vol. 27, no. 1, pp. 110\u2013123.","journal-title":"SIAM J. Optim."},{"key":"3766_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1134\/S0965542519010020","volume":"59","author":"D.R. Baimurzina","year":"2019","unstructured":"Baimurzina, D.R., Gasnikov, A.V., Gasnikova, E. V., Dvurechensky, P.E., Ershov, E.I., Kubentaeva, M.B., Lagunovskaya, A.A., Universal Method of Searching for Equilibria and Stochastic Equilibria in Transportation Networks, Comput. Math. Math. Phys., 2019, vol.\u00a059, no. 1, pp. 19\u201333.","journal-title":"Comput. Math. Math. Phys."},{"key":"3766_CR11","unstructured":"Gasnikov, A.V., Dvurechensky, P.E., and Usmanova, I.N., On nontriviality of fast (accelerated) randomizes methods, Tr. Mosk. Fiziko-Tekhnich. Inst., 2016, vol. 8, no.\u00a02(30), pp. 67\u2013100."},{"key":"3766_CR12","unstructured":"Gasnikova, E. et al., Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem, arXiv:2305.09069."},{"key":"3766_CR13","unstructured":"Allen-Zhu, Z. et al., Even faster accelerated coordinate descent using non-uniform sampling, Int. Conference on Machine Learning, PMLR, 2016, pp. 1110\u20131119."},{"key":"3766_CR14","unstructured":"Gasnikov, A.V., Klenov, S.L., Nurminskii, E.A., Kholodov, Ya.A., and Shamrai, N.B., Introduction to Mathematical Modeling of Transport Flows, Gasnikov, A.V., with appendices by Blank, M.L., Vorontsov, K.V. and Chekhovich, Yu.V., Gasnikova, E.V., Zamyatin, A.A. and Malyshev, V.A., Kolesnikov, A.V., Nesterov, Yu.E. and Shpirko, S.V., and Raigorodskii, Moscow: Mosk. Tsentr Nepreryvnogo Mat. Obrazovaniya, 2013, 2nd ed."},{"key":"3766_CR15","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"M. Patriksson","year":"2015","unstructured":"Patriksson, M., The Traffic Assignment Problem: Models and Methods, Courier Dover, 2015."},{"key":"3766_CR16","unstructured":"Stabler, B., Bar-Gera, H., and Sall, E., Transportation Networks for Research Core Team. Transportation Networks for Research. https:\/\/github.com\/bstabler\/TransportationNetworks. Accessed February 16, 2021."},{"key":"3766_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/A:1025350419398","volume":"3","author":"Y. Nesterov","year":"2003","unstructured":"Nesterov, Y. and De Palma, A., Stationary dynamic solutions in congested transportation networks: Summary and perspectives, Networks Spatial Econ., 2003, vol. 3, no. 3, pp. 371\u2013395.","journal-title":"Networks Spatial Econ."},{"key":"3766_CR18","first-page":"335","volume":"14","author":"E.V. Kotlyarova","year":"2022","unstructured":"Kotlyarova, E.V. et al., Justification of the connection of the Backmann model with degenerate cost functions to the model of stable dynamics, Komput. Issled. Model., 2022, vol. 14, no. 2, pp. 335\u2013342.","journal-title":"Komput. Issled. Model."},{"key":"3766_CR19","volume-title":"Entropy in Urban and Regional Modelling","author":"A.I. Wilson","year":"1970","unstructured":"Wilson, A.I., Entropy in Urban and Regional Modelling, London: 1970."},{"key":"3766_CR20","first-page":"111","volume":"28","author":"A.V. Gasnikov","year":"2016","unstructured":"Gasnikov, A.V., Gasnikova,\u00a0E.V., Mendel,\u00a0M.A., and Chepurchenko, K.V., Evolutionary interpretations of entropy model for correspondence matrix calculation, Mat. Model., 2016, vol. 28, no. 4, pp. 111\u2013124.","journal-title":"Mat. Model."},{"key":"3766_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y. Nesterov","year":"2007","unstructured":"Nesterov, Y., Smoothing technique and its applications in semidefinite optimization, Math. Program., 2007, vol. 110, no. 2, pp. 245\u2013259.","journal-title":"Math. Program."},{"key":"3766_CR22","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G. Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G. and Cuturi, M., Computational optimal transport: With applications to data science, Found. Trends Mach. Learn., 2019, vol. 11, nos. 5\u20136, pp. 355\u2013607.","journal-title":"Found. Trends Mach. Learn."},{"key":"3766_CR23","volume-title":"Accelerated alternating minimization","author":"S. Guminov","year":"2021","unstructured":"Guminov, S. et al., Accelerated alternating minimization, ICML, 2021."},{"key":"3766_CR24","unstructured":"Tupitsa, N. et al., Numerical methods for large-scale optimal transport. arXiv:2210.11368."},{"key":"3766_CR25","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y. Nesterov","year":"2015","unstructured":"Nesterov, Y., Universal gradient methods for convex optimization problems, Math. Program., 2015, vol. 152, nos. 1\u20132, pp. 381\u2013404.","journal-title":"Math. Program."},{"key":"3766_CR26","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1134\/S0965542518010050","volume":"58","author":"A.V. Gasnikov","year":"2018","unstructured":"Gasnikov, A.V. and Nesterov, Yu.E., Universal method for stochastic composite optimization problems, Comput. Math. Math. Phys., 2018, vol. 58, no. 1, pp. 48\u201364.","journal-title":"Comput. Math. Math. Phys."},{"key":"3766_CR27","unstructured":"Kovalev, D., Gasnikov, A., and Malinovsky, G., An optimal algorithm for strongly convex min-min optimization. arXiv:2212.14439."},{"key":"3766_CR28","unstructured":"Gasnikov\u2013Nesterov, A universal method for stochastic problems composite optimization. arxiv preprint arXiv:1604.05275. 2016."},{"key":"3766_CR29","unstructured":"Kubentayeva, Meruza et al., Primal-dual gradient methods for searching network equilibria in combined models with nested choice structure and capacity constraints. arXiv:2307.00427."},{"key":"3766_CR30","unstructured":"Gasnikov, A.V., Dvurechenskii, P.E, and Usmanova, I.N., On nontriviality of fast (accelerated) randomized methods. arxiv preprint arXiv:1508.02182. 2015."},{"key":"3766_CR31","first-page":"3","volume":"65","author":"A.S. Aliev","year":"2015","unstructured":"Aliev, A.S., Mazurin, D.S., Maksimova, D.A., and Shvetsov, V.I., The structure of complex model of the Moscow transportation system, Tr. Inst. Sist. Issled. RAS, 2015, vol. 65, no. 1, pp. 3\u201315.","journal-title":"Tr. Inst. Sist. Issled. RAS"},{"key":"3766_CR32","unstructured":"Gasnikov, A.V., Modern numerical optimization methods: Universal gradient descent method. arXiv:1711.00394."},{"key":"3766_CR33","unstructured":"Source codes of numerical experiments. https:\/\/github.com\/Lareton\/transport_network_optimization."},{"key":"3766_CR34","unstructured":"Nemirovskii A.S. and Yudin, D.B., Problem Complexity and Method Efficiency in Optimization, Interscience Series in Discrete Mathematics (Nauka, Moscow, 1979; Wiley, 1983), Vol. XV."},{"key":"3766_CR35","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y. Nesterov","year":"2012","unstructured":"Nesterov, Y., Efficiency of coordinate descent methods on huge-scale optimization problems, SIAM J. Optim., 2012, vol. 22, no. 2, pp. 341\u2013362.","journal-title":"SIAM J. Optim."},{"key":"3766_CR36","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1080\/0144164042000335805","volume":"25","author":"J. De Cea","year":"2005","unstructured":"De Cea, J., Fernandez, J. E., Dekock, V., and Soto, A., Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes, Transport Rev., 2005., vol. 25, no. 3, pp. 293\u2013317.","journal-title":"Transport Rev."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S036176882306004X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S036176882306004X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S036176882306004X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:54:30Z","timestamp":1775012070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S036176882306004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["3766"],"URL":"https:\/\/doi.org\/10.1134\/s036176882306004x","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"13 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}