{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:24:24Z","timestamp":1773617064861,"version":"3.50.1"},"reference-count":21,"publisher":"Pleiades Publishing Ltd","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"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":["Autom Remote Control"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1134\/s0005117921100064","type":"journal-article","created":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T05:02:57Z","timestamp":1637557377000},"page":"1679-1691","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Convex Min-Min Problems with Smoothness and Strong Convexity in One Group of Variables and Low Dimension in the Other"],"prefix":"10.1134","volume":"82","author":[{"given":"E.","family":"Gladin","sequence":"first","affiliation":[]},{"given":"M.","family":"Alkousa","sequence":"additional","affiliation":[]},{"given":"A.","family":"Gasnikov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2021,11,22]]},"reference":[{"issue":"3","key":"2185_CR1","first-page":"543","volume":"269","author":"Yu.E. Nesterov","year":"1983","unstructured":"Nesterov, Yu.E., Method of minimizing convex functions with convergence\nrate $$O(1\/k^2)\n$$, Dokl. Akad. Nauk\nSSSR, 1983, vol. 269, no. 3, pp. 543\u2013547.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2185_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and Stochastic Optimization Methods for Machine Learning","author":"G. Lan","year":"2020","unstructured":"Lan, G., First-order and Stochastic Optimization\nMethods for Machine Learning, Atlanta: Springer, 2020."},{"key":"2185_CR3","volume-title":"Sovremennye chislennye metody optimizatsii. Metod universal\u2019nogo gradientnogo spuska (Modern Numerical Optimization Methods. Universal Gradient Descent Method)","author":"A.V. Gasnikov","year":"2020","unstructured":"Gasnikov, A.V., Sovremennye chislennye metody optimizatsii. Metod\nuniversal\u2019nogo gradientnogo spuska (Modern Numerical Optimization Methods.\nUniversal Gradient Descent Method), Moscow: MTsNMO, 2020."},{"issue":"11","key":"2185_CR4","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1134\/S0965542520110020","volume":"60","author":"M.S. Alkousa","year":"2020","unstructured":"Alkousa, M.S., Dvinskikh, D.M., Stonyakin, F.S., Gasnikov, A.V., and\nKovalev, D., Accelerated methods for saddle point problems, Comput.\nMath. Math. Phys., 2020, vol. 60, no. 11, pp. 1787\u20131809.","journal-title":"Comput. Math. Math. Phys."},{"key":"2185_CR5","unstructured":"Gladin, E., Kuruzov, I., Stonyakin, F., Pasechnyuk, D., Alkousa, M., and\nGasnikov, A., Solving Strongly Convex-Concave Composite Saddle Point Problems with a Small\nDimension of One of the Variables.\nhttps:\/\/arxiv.org\/pdf\/2010.02280.pdf ."},{"key":"2185_CR6","unstructured":"Tianyi, L., Chi, J., and Michael, I.J., Near-Optimal Algorithms for Minimax\nOptimization.\nhttps:\/\/arxiv.org\/pdf\/2002.02417v5.pdf ."},{"key":"2185_CR7","unstructured":"Yuanhao, W. and Jian, L., Improved Algorithms for Convex-Concave\nMinimax Optimization.\nhttps:\/\/arxiv.org\/pdf\/2006.06359.pdf ."},{"key":"2185_CR8","unstructured":"Zhongruo Wang, Krishnakumar Balasubramanian, Shiqian Ma, and Meisam\nRazaviyayn, Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved\nComplexities.\nhttps:\/\/arxiv.org\/pdf\/2001.07819.pdf ."},{"key":"2185_CR9","volume-title":"Modeli ravnovesnogo raspredeleniya transportnykh potokov v bol\u2019shikh setyakh. Uch. pos. (Equilibrium Distribution Models of Traffic Flows in Large Networks. A Handbook)","author":"A.V. Gasnikov","year":"2020","unstructured":"Gasnikov, A.V. and Gasnikova, E.V., Modeli ravnovesnogo\nraspredeleniya transportnykh potokov v bol\u2019shikh setyakh. Uch. pos. (Equilibrium\nDistribution Models of Traffic Flows in Large Networks. A Handbook), Moscow: Mosk. Fiz.-Tekh.\nInst., 2020."},{"key":"2185_CR10","unstructured":"Bolte, J., Glaudin, L., Pauwels, E., and Serrurier, M., A H\u00f6lderian\nBacktracking Method for Min-Max and Min-Min Problems.\nhttps:\/\/arxiv.org\/pdf\/2007.08810.pdf ."},{"key":"2185_CR11","doi-asserted-by":"crossref","unstructured":"Jungers, M., Tr\u00e9lat, E., and Abou-Kandil, H., Min-max and min-min\nStackelberg strategies with closed-loop information structure, J. Dyn.\nControl Syst. Springer, 2011, no. 17(3), pp. 387\u2013425.","DOI":"10.1007\/s10883-011-9123-2"},{"key":"2185_CR12","unstructured":"Farhangi, H. and Konur, D., Set-based min-max and min-min robustness for\nmulti-objective robust optimization, Proc. 67th Annu. Conf. Expo\nInst. Ind. Eng. (Pittsburgh, PA, 2017), Inst. Ind. Eng. (IIE), 2017,\npp. 1217\u20131222."},{"key":"2185_CR13","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M., A new algorithm for minimizing convex functions over convex\nsets, Foundations of Computer Science. 30th Annu.\nSymp. (1989), pp. 338\u2013343.","DOI":"10.1109\/SFCS.1989.63500"},{"key":"2185_CR14","first-page":"291","volume":"73","author":"P.M. Vaidya","year":"1996","unstructured":"Vaidya, P.M., A new algorithm for minimizing convex functions over convex\nsets, Math. Program., 1996, vol. 73,\npp. 291\u2013341.","journal-title":"Math. Program."},{"key":"2185_CR15","unstructured":"Lan, G., Zhize Li, and Yi, Zhou., A unified variance-reduced accelerated\ngradient method for convex optimization, 33rd Conf. Neural Inf.\nProcess. Syst. (NeurIPS 2019) (Vancouver, Canada, 2019).\nhttps:\/\/arxiv.org\/pdf\/1905.12412.pdf ."},{"issue":"7","key":"2185_CR16","first-page":"1137","volume":"59","author":"A.I. Tyurin","year":"2019","unstructured":"Tyurin, A.I. and Gasnikov, A.V., Fast gradient descent method for convex\noptimization problems with an oracle that generates a $$(\\delta , L)\n$$-model of a function in a requested point,\nComput. Math. Math. Phys., 2019, vol. 59, no. 7,\npp. 1137\u20131150.","journal-title":"Comput. Math. Math. Phys."},{"issue":"3\u20134","key":"2185_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S. Bubeck","year":"2015","unstructured":"Bubeck, S., Convex optimization: algorithms and complexity, Found. Trends Mach. Learn., 2015, vol. 8, nos. 3\u20134,\npp. 231\u2013357","journal-title":"Found. Trends Mach. Learn."},{"key":"2185_CR18","unstructured":"Gladin, E., Sadiev, A., Gasnikov, A., Stonyakin, F., Dvurechensky, P.,\nBeznosikov, A., and Alkousa, M., Solving Smooth Min-Min and Min-Max Problems by Mixed\nOracle Algorithms.\nhttps:\/\/arxiv.org\/pdf\/2103.00434.pdf ."},{"key":"2185_CR19","volume-title":"Vvedenie v optimizatsiyu (Introduction to Optimization)","author":"B.T. Polyak","year":"1983","unstructured":"Polyak, B.T., Vvedenie v optimizatsiyu (Introduction to\nOptimization), Moscow: Nauka, 1983."},{"issue":"4(28)","key":"2185_CR20","first-page":"143","volume":"7","author":"A.V. Gasnikov","year":"2015","unstructured":"Gasnikov, A.V., Dvurechenskii, P.E., Kamzolov, D.I., Nesterov, Yu.E.,\nSpokoinyi, V.G., Stetsyuk, P.I., Suvorikova, A.L., and Chernov, A.V., Finding equilibria in\nmultistage transport models, Tr. Mosk. Fiz.-Tekh. Inst.,\n2015, vol. 7, no. 4(28), pp. 143\u2013155.","journal-title":"Tr. Mosk. Fiz.-Tekh. Inst."},{"key":"2185_CR21","volume-title":"Pattern Recognition and Machine Learning","author":"C. Bishop","year":"2006","unstructured":"Bishop, C., Pattern Recognition and Machine\nLearning, New York: Springer, 2006."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921100064.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117921100064","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921100064.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:33:17Z","timestamp":1773613997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117921100064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":21,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["2185"],"URL":"https:\/\/doi.org\/10.1134\/s0005117921100064","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]},"assertion":[{"value":"28 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}