{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:18:47Z","timestamp":1773656327186,"version":"3.50.1"},"reference-count":30,"publisher":"Pleiades Publishing Ltd","issue":"11","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"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":[[2016,11]]},"DOI":"10.1134\/s0005117916110114","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T05:48:39Z","timestamp":1478843319000},"page":"2018-2034","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex"],"prefix":"10.1134","volume":"77","author":[{"given":"A. V.","family":"Gasnikov","sequence":"first","affiliation":[]},{"given":"A. A.","family":"Lagunovskaya","sequence":"additional","affiliation":[]},{"given":"I. N.","family":"Usmanova","sequence":"additional","affiliation":[]},{"given":"F. A.","family":"Fedorenko","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2016,11,12]]},"reference":[{"key":"539_CR1","volume-title":"Algorithmic Models of Human Behavior. A Presentation at the Mathematical Seminar","author":"Yu.E. Nesterov","year":"2012","unstructured":"Nesterov, Yu.E., Algorithmic Models of Human Behavior. A Presentation at the Mathematical Seminar, Moscow: MFTI&MTSNMO, September 14, 2012 (http:\/\/www.mathnet.ru\/php\/seminars. phtml?option lang=rus&presentid=6990)."},{"issue":"5","key":"539_CR2","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","volume":"61","author":"J.C. Duchi","year":"2015","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J., and Wibisono, A., Optimal Rates for Zero-order Convex Optimization: The Power of Two Function Evaluations, IEEE Transact. Inform., 2015, vol. 61, no. 5, pp. 2788\u20132806 (http:\/\/www.eecs.berkeley.edu\/~wainwrig\/Papers\/DucZero15.pdf).","journal-title":"IEEE Transact. Inform."},{"issue":"5","key":"539_CR3","doi-asserted-by":"publisher","first-page":"3235","DOI":"10.1109\/TIT.2011.2182178","volume":"58","author":"A. Agarwal","year":"2012","unstructured":"Agarwal, A., Bartlett, P.L., Ravikumar, P., and Wainwright, M.J., Information-theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization, IEEE Transact. Inform., 2012, vol. 58, no. 5, pp. 3235\u20133249, arXiv:1009.0571.","journal-title":"IEEE Transact. Inform."},{"key":"539_CR4","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J. Kiefer","year":"1952","unstructured":"Kiefer, J. and Wolfowitz, J., Statistical Estimation on the Maximum of a Regression Function, Ann. Math. Statist., 1952, vol. 23, pp. 462\u2013466.","journal-title":"Ann. Math. Statist."},{"key":"539_CR5","volume-title":"Vvedenie v optimizatsiyu","author":"B.T. Polyak","year":"1987","unstructured":"Polyak, B.T., Vvedenie v optimizatsiyu, Moscow: Nauka, 1983. Translated into English under the title Introduction to Optimization, New York: Optimization Software, 1987."},{"key":"539_CR6","volume-title":"Randomizirovannye algoritmy otsenivaniya i optimizatsii pri pochti proizvol\u2019nykh pomekhakh","author":"O.N. Granichin","year":"2003","unstructured":"Granichin, O.N. and Polyak, B.T., Randomizirovannye algoritmy otsenivaniya i optimizatsii pri pochti proizvol\u2019nykh pomekhakh (Randomized Algorithms of Estimation and Optimization under Almost Arbitrary Noise) Moscow: Nauka, 2003."},{"key":"539_CR7","volume-title":"Slozhnost\u2019 zadach i effektivnost\u2019 metodov optimizatsii","author":"A.S. Nemirovskii","year":"1979","unstructured":"Nemirovskii, A.S. and Yudin, D.B., Slozhnost\u2019 zadach i effektivnost\u2019 metodov optimizatsii (Complexity of Problems and Efficiency of the Optimization Methods), Moscow: Nauka, 1979."},{"key":"539_CR8","volume-title":"e-print","author":"J. Konecn\u00fd","year":"2014","unstructured":"Konecn\u00fd, J. and Rich\u00e1rik, P., Simple Complexity Analysis of Simplified Direct Search, in e-print, 2014, arXiv:1410.0390."},{"key":"539_CR9","volume-title":"MPS-SIAM Series Optim.","author":"A. Shapiro","year":"2014","unstructured":"Shapiro, A., Dentcheva, D., and Ruszczynski, A., Lecture on Stochastic Programming. Modeling and Theory, in MPS-SIAM Series Optim., 2014."},{"issue":"1","key":"539_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y. Nesterov","year":"2009","unstructured":"Nesterov, Y., Primal-Dual Subgradient Methods For Convex Problems, Math. Program., Ser. B, 2009, vol. 120(1), pp. 261\u2013283.","journal-title":"Math. Program., Ser. B"},{"issue":"4","key":"539_CR11","first-page":"78","volume":"41","author":"A.B. Yuditskii","year":"2005","unstructured":"Yuditskii, A.B., Nazin, A.V., Tsybakov, A.B., and Vayatis, N., Recurrent Aggregation of Estimates by the Method of Mirror Descent with Averaging, Probl. Peredachi Inf., 2005, vol. 41, no. 4, pp. 78\u201396.","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"539_CR12","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A. Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., and Shapiro, A., Stochastic Approximation Approach to Stochastic Programming, SIAM J. Optim., 2009, vol. 19, no. 4, pp. 1574\u20131609.","journal-title":"SIAM J. Optim."},{"issue":"4","key":"539_CR13","first-page":"55","volume":"55","author":"A.V. Gasnikov","year":"2015","unstructured":"Gasnikov, A.V., Nesterov, Yu.E., and Spokoinyi, V.G., On Efficiency of One Method for Randomization of the Mirror Descent in the Problems of Online Optimization, Zh. Vychisl. Mat. Mat. Fiz., 2015, vol. 55, no. 4, pp. 55\u201371.","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"issue":"1","key":"539_CR14","first-page":"41","volume":"8","author":"A.V. Gasnikov","year":"2016","unstructured":"Gasnikov, A.V., Dvurechenskii, P.E., and Nesterov, Yu.E., Stochastic Gradient Methods with Inaccurate Oracle, Tr. MFTI, 2016, vol. 8, no, 1. pp. 41\u201391, arxiv:1411.4218.","journal-title":"Tr. MFTI"},{"key":"539_CR15","volume-title":"e-print","author":"L. Bogolubsky","year":"2016","unstructured":"Bogolubsky, L., Dvurechensky, P., Gasnikov, A., et al., Learning Supervised PageRank with Gradientbased and Gradient-free Optimization Methods, in e-print, 2016, arXiv:1603.00717."},{"key":"539_CR16","first-page":"111","volume-title":"Dinamika sistem and protsessy upravleniya (System Dynamics and Control Processes), Proc. Int. Conf. in honour of 90th Anniversary of Academician N.N. Krasovskii, Yekaterinburg, September 15\u201320, 2014, Yekaterinburg: Krasovskii Inst. Math. Mech. Uro RAN","author":"A.V. Gasnikov","year":"2015","unstructured":"Gasnikov, A.V., Dvurechenskii, P.E., and Kamzolov, D.I., Gradient and Direct Methods with Inaccurate Oracle for Problems of Stochastic Optimization, in Dinamika sistem and protsessy upravleniya (System Dynamics and Control Processes), Proc. Int. Conf. in honour of 90th Anniversary of Academician N.N. Krasovskii, Yekaterinburg, September 15\u201320, 2014, Yekaterinburg: Krasovskii Inst. Math. Mech. Uro RAN, 2015, pp. 111\u2013117, arXiv:1502.06259."},{"key":"539_CR17","first-page":"1","volume":"40","author":"A. Belloni","year":"2015","unstructured":"Belloni, A., Liang, T., Narayanan, H., and Rakhlin, A., Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions, JMLR. Workshop Conf. Proc., 2015, vol. 40, pp. 1\u201326, arXiv:1501.07242.","journal-title":"JMLR. Workshop Conf. Proc."},{"key":"539_CR18","volume-title":"CORE Discussion Paper 2011\/1","author":"Yu. Nesterov","year":"2011","unstructured":"Nesterov, Yu., Random Gradient-free Minimization of Convex Functions, in CORE Discussion Paper 2011\/1, 2011."},{"key":"539_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization: Estimation, Simulation and Control","author":"J.C. Spall","year":"2003","unstructured":"Spall, J.C., Introduction to Stochastic Search and Optimization: Estimation, Simulation and Control, New York: Wiley, 2003."},{"issue":"1","key":"539_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S. Bubeck","year":"2012","unstructured":"Bubeck, S. and Cesa-Bianchi, N., Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems, Foundat. Trends Machine Learning, 2012, vol. 5, no. 1, pp. 1\u2013122, arXiv:1204.5721.","journal-title":"Foundat. Trends Machine Learning"},{"key":"539_CR21","volume-title":"Lectures on Modern Convex Optimization Analysis, Algorithms, and Engineering Applications","author":"A. Nemirovski","year":"2013","unstructured":"Nemirovski, A., Lectures on Modern Convex Optimization Analysis, Algorithms, and Engineering Applications, Philadelphia: SIAM, 2013 (http:\/\/www2.isye.gatech.edu\/~nemirovs\/Lect ModConvOpt.pdf)."},{"key":"539_CR22","volume-title":"Extremes of Related Properties of Random Sequences and Processes","author":"M. Leadbetter","year":"1986","unstructured":"Leadbetter, M., Lindgren, G., and Rootzen, K., Extremes of Related Properties of Random Sequences and Processes, New York: Springer-Verlag, 1986. Translated under the title Ekstremumy sluchainykh posledovatel\u2019nostei i protsessov, Moscow: Mir, 1989."},{"key":"539_CR23","volume-title":"Concentration of Measure Phenomenon, Providence: Am. Math. Soc.","author":"M. Ledoux","year":"2001","unstructured":"Ledoux, M., Concentration of Measure Phenomenon, Providence: Am. Math. Soc. (Math. Surveys Monogr., vol. 89), 2001."},{"key":"539_CR24","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","author":"S. Boucheron","year":"2013","unstructured":"Boucheron, S., Lugoshi, G., and Massart, P., Concentration Inequalities: A Nonasymptotic Theory of Independence, Oxford: Oxford Univ. Press, 2013."},{"key":"539_CR25","unstructured":"Gasnikov, A.V., Dvurechenskii, P.E., Dorn, Yu.V., and Maksimov, Yu.V., Numerical Methods for Seeking Equilibrium Flow Distribution in the Backman Model and Stable Dynammice Model, Mat. Modelirovanie, 2016, vol. 28 (in press), arXiv:1506.00293."},{"key":"539_CR26","volume-title":"Asimptoticheskaya teoriya otsenivaniya","author":"I.A. Ibragimov","year":"1977","unstructured":"Ibragimov, I.A. and Khas\u2019minskii, R.Z., Asimptoticheskaya teoriya otsenivaniya (Asymptotic Estimation Theory), Moscow: Nauka, 1977."},{"key":"539_CR27","volume-title":"Coordinate Descent Algorithms","author":"S.J. Wright","year":"2015","unstructured":"Wright, S.J., Coordinate Descent Algorithms, Optimizat. Online, 2015 (http:\/\/www.optimizationonline. org\/DB FILE\/2014\/12\/4679.pdf)."},{"key":"539_CR28","volume-title":"Proc. Int. Conf. ITAS-2015, Russia, Sochi, September","author":"A. Anikin","year":"2015","unstructured":"Anikin, A., Dvurechensky, P., Gasnikov, A., et al., Modern Efficient Numerical Approaches to Regularized Regression Problems in Application to Traffic Demands Matrix Calculation From Link Loads, in Proc. Int. Conf. ITAS-2015, Russia, Sochi, September, 2015, arXiv:1508.00858."},{"key":"539_CR29","first-page":"2","volume":"8","author":"A.V. Gasnikov","year":"2016","unstructured":"Gasnikov, A.V., Dvurechenskii, P.E., and Usmanova, I.N., On Nontriviality of Fast (Accelerated) Randomized Methods, Tr. MFTI, 2016, vol. 8, no. 2, arXiv:1508.02182.","journal-title":"Tr. MFTI"},{"key":"539_CR30","volume-title":"Optimization for Machine Learning","author":"A. Juditsky","year":"2012","unstructured":"Juditsky, A. and Nemirovski, A., First Order Methods for Nonsmooth Convex Large-scale Optimization. I, II, in Optimization for Machine Learning, Sra, S., Nowozin, S., and Wright, S., Eds., Boston: MIT Press, 2012."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916110114.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117916110114","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916110114.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:28:42Z","timestamp":1773613722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117916110114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":30,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["539"],"URL":"https:\/\/doi.org\/10.1134\/s0005117916110114","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]},"assertion":[{"value":"12 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}