{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:34Z","timestamp":1740123694231,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"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":["Numer Algor"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11075-023-01574-1","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T11:01:57Z","timestamp":1691060517000},"page":"351-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic incremental mirror descent algorithms with Nesterov smoothing"],"prefix":"10.1007","volume":"95","author":[{"given":"Sandy","family":"Bitterlich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1139-7504","authenticated-orcid":false,"given":"Sorin-Mihai","family":"Grad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,3]]},"reference":[{"key":"1574_CR1","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s11081-018-9378-5","volume":"19","author":"M Ahookhosh","year":"2018","unstructured":"Ahookhosh, M.: Optimal subgradient methods: computational properties for large-scale linear inverse problems. Optim Eng 19, 815\u2013844 (2018)","journal-title":"Optim Eng"},{"key":"1574_CR2","unstructured":"Z. Allen-Zhu, L. Orecchia: Linear coupling: An ultimate unification of gradient and mirror descent, In: C.H. Papadimitrou (ed.), Innovations in Theoretical Computer Science (ITCS 2017), Leibniz Int Pr Infor 8, Art. No. 3, 3:1\u20133:22 (2017)"},{"key":"1574_CR3","unstructured":"M. Amini, F. Yousefian: An iterative regularized mirror descent method for ill-posed nondifferetiable stochastic optimization, http:\/\/arxiv.org\/abs\/1901.09506 (2019)"},{"key":"1574_CR4","doi-asserted-by":"crossref","unstructured":"N. Azizan, B. Hassibi: A characterization of stochastic mirror descent algorithms and their convergence properties, In: Int Conf Acoust Spee (ICASSP-2019), 5167\u20135171 (2019)","DOI":"10.1109\/ICASSP.2019.8682271"},{"key":"1574_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/130941961","volume":"25","author":"F Bach","year":"2015","unstructured":"Bach, F.: Duality between subgradient and conditional gradient methods. SIAM J Optim 25, 115\u2013129 (2015)","journal-title":"SIAM J Optim"},{"key":"1574_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"key":"1574_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper Res Lett 31, 167\u2013175 (2003)","journal-title":"Oper Res Lett"},{"key":"1574_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/100818327","volume":"22","author":"A Beck","year":"2012","unstructured":"Beck, A., Teboulle, M.: Smoothing and first order methods: a unified framework. SIAM J Optim 22, 557\u2013580 (2012)","journal-title":"SIAM J Optim"},{"key":"1574_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S1052623499354564","volume":"12","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Margalit, T., Nemirovski, A.: The ordered subsets mirror descent optimization method with applications to tomography. SIAM J Optim 12, 79\u2013108 (2001)","journal-title":"SIAM J Optim"},{"key":"1574_CR10","first-page":"1","volume":"68","author":"RI Bo\u0163","year":"2018","unstructured":"Bo\u0163, R.I., B\u00f6hm, A.: An incremental mirror descent subgradient algorithm with random sweeping and proximal step. Optimization 68, 1\u201318 (2018)","journal-title":"Optimization"},{"key":"1574_CR11","doi-asserted-by":"crossref","unstructured":"Bo\u0163, R.I., B\u00f6hm, A.: Variable smoothing for convex optimization problems using stochastic gradients, J Sci Comput 85:33 (2020)","DOI":"10.1007\/s10915-020-01332-8"},{"key":"1574_CR12","doi-asserted-by":"crossref","unstructured":"J.-P. Calliess: Lipschitz optimisation for Lipschitz interpolation, In: 2017 American Control Conference (ACC2017), 17000349 (2017)","DOI":"10.23919\/ACC.2017.7963430"},{"key":"1574_CR13","unstructured":"A. Defazio: A simple practical accelerated method for finite sums, In: D.D. Lee, U. von Luxburg, R. Garnett, M. Sugiyama and I.M.Guyon (eds.), Adv Neur In 29 (NIPS 2016)"},{"key":"1574_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/LCSYS.2018.2854889","volume":"3","author":"TT Doan","year":"2019","unstructured":"Doan, T.T., Bose, S., Nguyen, D.H., Beck, C.L.: Convergence of the iterates in mirror descent methods. IEEE Contr Syst Lett 3, 114\u2013119 (2019)","journal-title":"IEEE Contr Syst Lett"},{"key":"1574_CR15","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1137\/110836043","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Agarwal, A., Johansson, M., Jordan, M.I.: Ergodic mirror descent. SIAM J Optim 22, 1549\u20131578 (2012)","journal-title":"Ergodic mirror descent. SIAM J Optim"},{"key":"1574_CR16","unstructured":"R.M. Freund, P. Grigas, R. Mazumder: AdaBoost and forward stagewise regression are first-order convex optimization methods, http:\/\/arxiv.org\/abs\/1307.1192 (2013)"},{"key":"1574_CR17","unstructured":"G. Goh: Optimization with Costly Subgradients, ProQuest Dissertations Publishing, 2017.10685037 (2017)"},{"key":"1574_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10898-019-00746-5","volume":"74","author":"S-M Grad","year":"2019","unstructured":"Grad, S.-M., Wilfer, O.: A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality. J Glob Optim 74, 121\u2013160 (2019)","journal-title":"J Glob Optim"},{"key":"1574_CR19","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-020-01490-5","volume":"187","author":"V Guigues","year":"2021","unstructured":"Guigues, V.: Inexact stochastic mirror descent for two-stage nonlinear stochastic programs. Math Program 187, 533\u2013577 (2021)","journal-title":"Math Program"},{"key":"1574_CR20","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10589-021-00284-5","volume":"79","author":"F Hanzely","year":"2021","unstructured":"Hanzely, F., Richt\u00e1rik, P.: Fastest rates for stochastic mirror descent methods. Comput Optim Appl 79, 717\u2013766 (2021)","journal-title":"Comput Optim Appl"},{"key":"1574_CR21","unstructured":"L.T.K. Hien, N. Gillis, P. Patrinos: Inertial block mirror descent method for non-convex non-smooth optimization, http:\/\/arxiv.org\/abs\/1903.01818 (2019)"},{"key":"1574_CR22","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10957-018-01469-5","volume":"181","author":"LTK Hien","year":"2019","unstructured":"Hien, L.T.K., Nguyen, C.V., Xu, H., Lu, C., Feng, J.: Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization. J Optim Theory Appl 181, 541\u2013566 (2019)","journal-title":"J Optim Theory Appl"},{"key":"1574_CR23","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1137\/15M104013X","volume":"9","author":"V Hovhannisyan","year":"2016","unstructured":"Hovhannisyan, V., Parpas, P., Zafeiriou, S.: MAGMA - multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization. SIAM J Imaging Sci 9, 1829\u20131857 (2016)","journal-title":"SIAM J Imaging Sci"},{"key":"1574_CR24","doi-asserted-by":"publisher","first-page":"7851","DOI":"10.1016\/j.ifacol.2020.12.1958","volume":"53","author":"A Ivanova","year":"2020","unstructured":"Ivanova, A., Stonyakin, F., Pasechnyuk, D., Vorontsova, E., Gasnikov, A.: Adaptive mirror descent for the network utility maximization problem. IFAC-PapersOnLine 53, 7851\u20137856 (2020)","journal-title":"IFAC-PapersOnLine"},{"key":"1574_CR25","doi-asserted-by":"crossref","unstructured":"Juditsky, A., Kwon, J., Moulines, \u00c9.: Unifying mirror descent and dual averaging, Math Program 199, 793\u2013830 (2023)","DOI":"10.1007\/s10107-022-01850-3"},{"key":"1574_CR26","unstructured":"W. Krichene, A. M. Bayen, P. L. Bartlett: Accelerated mirror descent in continuous and discrete time, Adv Neur In 2 (NIPS 2015), 2845\u20132853 (2015)"},{"key":"1574_CR27","doi-asserted-by":"crossref","unstructured":"G. Kunapuli, J. Shavlik: Mirror descent for metric learning: a unified approach, In: P.A. Flach, T. De Bie and N. Cristianini (eds.), Machine Learning and Knowledge Discovery in Databases - ECML PKDD 2012, Lect Notes Artif Int 7523, 859-874 (2012)","DOI":"10.1007\/978-3-642-33460-3_60"},{"key":"1574_CR28","unstructured":"Y.-H. Li, C.A. Riofr\u00edo, V. Cevher: A general convergence result for mirror descent with Armijo line search, http:\/\/arxiv.org\/abs\/1805.12232 (2018)"},{"key":"1574_CR29","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/ijoo.2018.0008","volume":"4","author":"H Lu","year":"2019","unstructured":"Lu, H.: Relative continuity for non-Lipschitz nonsmooth convex optimization using stochastic (or deterministic) mirror descent. INFORMS J Optim 4, 288\u2013303 (2019)","journal-title":"INFORMS J Optim"},{"key":"1574_CR30","doi-asserted-by":"crossref","unstructured":"D.V.N. Luong, P. Parpas, D. Rueckert, B. Rustem: Solving MRF minimization by mirror descent, In: G. Bebis et\u00a0al. (eds.), Advances in Visual Computing (ISVC 2012), Lect Notes Comput Sci 7431, Springer, 587\u2013598 (2012)","DOI":"10.1007\/978-3-642-33179-4_56"},{"key":"1574_CR31","unstructured":"S. Mahadevan, B. Liu, P. Thomas, W. Dabney, S. Giguere, N. Jacek, I. Gemp, J. Liu: Proximal reinforcement learning: a new theory of sequential decision making in primal-dual spaces, http:\/\/arxiv.org\/abs\/1405.6757 (2014)"},{"key":"1574_CR32","unstructured":"H.B. McMahan: A unified view of regularized dual averaging and mirror descent with implicit updates, http:\/\/arxiv.org\/abs\/1009.3240v2 (2011)"},{"key":"1574_CR33","unstructured":"P. Mertikopoulos, B. Lecouat, H. Zenati, C.-S. Foo, V. Chandrasekhar, G. Piliouras: Optimistic mirror descent in saddle-point problems - going the extra (gradient) mile, International Conference on Learning Representations (ICLR 2019), 1\u201323 (2019)"},{"key":"1574_CR34","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1007\/s10957-018-1346-x","volume":"179","author":"P Mertikopoulos","year":"2018","unstructured":"Mertikopoulos, P., Staudigl, M.: Stochastic mirror descent dynamics and their convergence in monotone variational inequalities. J Optim Theory Appl 179, 838\u2013867 (2018)","journal-title":"J Optim Theory Appl"},{"key":"1574_CR35","unstructured":"K. Mishchenko: Sinkhorn algorithm as a special case of stochastic mirror descent, http:\/\/arxiv.org\/abs\/1909.06918 (2019)"},{"key":"1574_CR36","doi-asserted-by":"crossref","unstructured":"A.V. Nazin, S. Anulova, A. Tremba: Application of the mirror descent method to minimize average losses coming by a Poisson flow, In: Proceedings of the European Control Conference (ECC14), 2194\u20132197 (2014)","DOI":"10.1109\/ECC.2014.6862486"},{"key":"1574_CR37","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/120894464","volume":"24","author":"A Nedi\u0107","year":"2014","unstructured":"Nedi\u0107, A., Lee, S.: On stochastic subgradient mirror-descent algorithm with weighted averaging. SIAM J Optim 24, 84\u2013107 (2014)","journal-title":"SIAM J Optim"},{"key":"1574_CR38","unstructured":"Nemirovski, A.: Efficient methods for large-scale convex optimization problems. \u00c9kon Mat Metody 2, 135\u2013152 (1979). ((in Russian))"},{"key":"1574_CR39","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski, A., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. J. Wiley & Sons, New York (1983)"},{"key":"1574_CR40","doi-asserted-by":"publisher","first-page":"221","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 120, 221\u2013259 (2009)","journal-title":"Math Program"},{"key":"1574_CR41","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math Program 103, 127\u2013152 (2005)","journal-title":"Math Program"},{"key":"1574_CR42","doi-asserted-by":"crossref","unstructured":"Y. Nesterov: Lectures on Convex Optimization, Springer (2018)","DOI":"10.1007\/978-3-319-91578-4"},{"issue":"7\u20138","key":"1574_CR43","first-page":"1601","volume":"69","author":"MN Nguyen","year":"2019","unstructured":"Nguyen, M.N., Le, T.H.A., Giles, D., Nguyen, T.A.: Smoothing techniques and difference of convex functions algorithms for image reconstruction. Optimization 69(7\u20138), 1601\u20131633 (2019)","journal-title":"Optimization"},{"key":"1574_CR44","first-page":"301","volume":"12","author":"R Paulavicius","year":"2006","unstructured":"Paulavicius, R.: J, Zilinskas: Analysis of different norms and corresponding Lipschitz constants for global optimization. Inf Technol Control 12, 301\u2013306 (2006)","journal-title":"Inf Technol Control"},{"key":"1574_CR45","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10589-016-9873-6","volume":"66","author":"T-D Quoc","year":"2017","unstructured":"Quoc, T.-D.: Adaptive smoothing algorithms for nonsmooth composite convex minimization. Comput Optim Appl 66, 425\u2013451 (2017)","journal-title":"Comput Optim Appl"},{"key":"1574_CR46","doi-asserted-by":"crossref","unstructured":"R.T. Rockafellar: Convex Analysis, Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"1574_CR47","unstructured":"S. Roweis: Data for Matlab hackers, http:\/\/www.cs.nyu.edu\/data.html"},{"key":"1574_CR48","unstructured":"F. Sch\u00e4fer, A. Anandkumar, H. Owhadi: Competitive mirror descent, http:\/\/arxiv.org\/abs\/2006.10179 (2020)"},{"key":"1574_CR49","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s10559-017-9923-9","volume":"53","author":"VV Semenov","year":"2017","unstructured":"Semenov, V.V.: A version of the mirror descent method to solve variational inequalities. Cybern Syst Anal 53, 234\u2013243 (2017)","journal-title":"Cybern Syst Anal"},{"key":"1574_CR50","first-page":"133","volume":"2020","author":"A Titov","year":"2020","unstructured":"Titov, A., Stonyakin, F., Alkousa, M., Ablaev, S., Gasnikov, A.: Analogues of switching subgradient schemes for relatively Lipschitz-continuous convex programming problems. MOTOR 2020, 133\u2013149 (2020)","journal-title":"MOTOR"},{"key":"1574_CR51","unstructured":"S. Zhang, N. He: On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization, http:\/\/arxiv.org\/abs\/1806.04781 (2018)"},{"key":"1574_CR52","unstructured":"X. Zhou, C. Du, X. Cai: An efficient smoothing proximal gradient algorithm for convex clustering, http:\/\/arxiv.org\/abs\/2006.12592 (2020)"},{"key":"1574_CR53","unstructured":"Y. Zhou, Y. Liang, L. Shen: A unified approach to proximal algorithms using Bregman distance, Technical Report, Syracuse University (2016)"},{"key":"1574_CR54","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/17M1134925","volume":"30","author":"Z Zhou","year":"2020","unstructured":"Zhou, Z., Mertikopoulos, P., Bambos, N., Boyd, S.P., Glynn, P.W.: On the convergence of mirror descent beyond stochastic convex programming. SIAM J Optim 30, 687\u2013716 (2020)","journal-title":"SIAM J Optim"},{"key":"1574_CR55","unstructured":"J. Zimmert, T. Lattimore: Connections between mirror descent, Thompson sampling and the information ratio, In: H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. Fox and R. Garnett (eds.), Adv Neur In 32 (NIPS 2019), 11973\u201311982 (2019)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01574-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01574-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01574-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T10:34:30Z","timestamp":1704364470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01574-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,3]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1574"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01574-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2023,8,3]]},"assertion":[{"value":"7 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}