{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:19:14Z","timestamp":1770229154112,"version":"3.49.0"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:00:00Z","timestamp":1698105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:00:00Z","timestamp":1698105600000},"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":["Comput Manag Sci"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10287-023-00479-7","type":"journal-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T07:02:30Z","timestamp":1698130950000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Non-smooth setting of stochastic decentralized convex optimization problem over time-varying Graphs"],"prefix":"10.1007","volume":"20","author":[{"given":"Aleksandr","family":"Lobanov","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Veprikov","sequence":"additional","affiliation":[]},{"given":"Georgiy","family":"Konin","sequence":"additional","affiliation":[]},{"given":"Aleksandr","family":"Beznosikov","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]},{"given":"Dmitry","family":"Kovalev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,24]]},"reference":[{"key":"479_CR1","unstructured":"Agarwal A, Dekel O, Xiao L (2010) Optimal algorithms for online convex optimization with multi-point bandit feedback. In: Colt. Citeseer, pp 28\u201340"},{"key":"479_CR2","first-page":"9017","volume":"33","author":"A Akhavan","year":"2020","unstructured":"Akhavan A, Pontil M, Tsybakov A (2020) Exploiting higher order smoothness in derivative-free optimization and continuous bandits. Adv Neural Inf Process Syst 33:9017\u20139027","journal-title":"Adv Neural Inf Process Syst"},{"key":"479_CR3","first-page":"7685","volume":"35","author":"A Akhavan","year":"2022","unstructured":"Akhavan A, Chzhen E, Pontil M, Tsybakov A (2022) A gradient estimator via l1-randomization for online zero-order optimization with two point feedback. Adv Neural Inf Process Syst 35:7685\u20137696","journal-title":"Adv Neural Inf Process Syst"},{"key":"479_CR4","unstructured":"Akhavan A, Chzhen E, Pontil M, Tsybakov AB (2023) Gradient-free optimization of highly smooth functions: improved analysis and a new algorithm. arXiv:2306.02159"},{"key":"479_CR5","unstructured":"Assran M, Loizou N, Ballas N, Rabbat M (2019) Stochastic gradient push for distributed deep learning. In: International conference on machine learning. PMLR, pp 344\u2013353"},{"key":"479_CR6","doi-asserted-by":"crossref","unstructured":"Audet C, Hare W (2017) Derivative-free and blackbox optimization","DOI":"10.1007\/978-3-319-68913-5"},{"key":"479_CR7","unstructured":"Bach F, Perchet V (2016) Highly-smooth zero-th order online optimization. In: Conference on learning theory. PMLR, pp 257\u2013283"},{"key":"479_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-021-09499-8","volume":"22","author":"K Balasubramanian","year":"2022","unstructured":"Balasubramanian K, Ghadimi S (2022) Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points. Found Comput Math 22:1\u201342","journal-title":"Found Comput Math"},{"issue":"1","key":"479_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TCNS.2014.2309751","volume":"1","author":"A Beck","year":"2014","unstructured":"Beck A, Nedi\u0107 A, Ozdaglar A, Teboulle M (2014) An $$ o (1\/k) $$ gradient method for network resource allocation problems. IEEE Trans Control Netw Syst 1(1):64\u201373","journal-title":"IEEE Trans Control Netw Syst"},{"key":"479_CR10","unstructured":"Bogolubsky L, Dvurechenskii P, Gasnikov A, Gusev G, Nesterov Y, Raigorodskii AM, Tikhonov A, Zhukovskii M (2016) Learning supervised pagerank with gradient-based and gradient-free optimization methods. Adv Neural Inf Process Syst 29"},{"issue":"3\u20134","key":"479_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck S et al (2015) Convex optimization: algorithms and complexity. Found Trends\u00ae Mach Learn 8(3\u20134):231\u2013357","journal-title":"Found Trends\u00ae Mach Learn"},{"key":"479_CR12","doi-asserted-by":"crossref","unstructured":"Bubeck S, Lee YT, Eldan R (2017) Kernel-based methods for bandit convex optimization. In: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, pp 72\u201385","DOI":"10.1145\/3055399.3055403"},{"issue":"4","key":"479_CR13","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/TAC.2014.2305952","volume":"59","author":"K Cai","year":"2014","unstructured":"Cai K, Ishii H (2014) Average consensus on arbitrary strongly connected digraphs with time-varying topologies. IEEE Trans Autom Control 59(4):1066\u20131071","journal-title":"IEEE Trans Autom Control"},{"issue":"3","key":"479_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang C-C, Lin C-J (2011) Libsvm: a library for support vector machines. ACM Trans Intell Syst Technol (TIST) 2(3):1\u201327","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"479_CR15","unstructured":"Chowdhery A, Narang S, Devlin J, Bosma M, Mishra G, Roberts A, Barham P, Chung HW, Sutton C, Gehrmann S et al (2022) Palm: scaling language modeling with pathways. arXiv:2204.02311"},{"key":"479_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to derivative-free optimization","author":"AR Conn","year":"2009","unstructured":"Conn AR, Scheinberg K, Vicente LN (2009) Introduction to derivative-free optimization. SIAM, Philadelphia"},{"key":"479_CR17","unstructured":"Dean J, Corrado G, Monga R, Chen K, Devin M, Mao M, Ranzato M, Senior A, Tucker P, Yang K et al (2012) Large scale distributed deep networks. Adv Neural Inf Process Syst 25"},{"issue":"1","key":"479_CR18","first-page":"165","volume":"13","author":"O Dekel","year":"2012","unstructured":"Dekel O, Gilad-Bachrach R, Shamir O, Xiao L (2012) Optimal distributed online prediction using mini-batches. J Mach Learn Res 13(1):165\u2013202","journal-title":"J Mach Learn Res"},{"issue":"5","key":"479_CR19","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","volume":"61","author":"JC Duchi","year":"2015","unstructured":"Duchi JC, Jordan MI, Wainwright MJ, Wibisono A (2015) Optimal rates for zero-order convex optimization: the power of two function evaluations. IEEE Trans Inf Theory 61(5):2788\u20132806","journal-title":"IEEE Trans Inf Theory"},{"key":"479_CR20","doi-asserted-by":"crossref","unstructured":"Dvinskikh D, Tominin V, Tominin I, Gasnikov A (2022) Noisy zeroth-order optimization for non-smooth saddle point problems. In: Mathematical optimization theory and operations research: 21st international conference, MOTOR 2022, Petrozavodsk, Russia, July 2\u20136, 2022, Proceedings. Springer, pp 18\u201333","DOI":"10.1007\/978-3-031-09607-5_2"},{"issue":"2","key":"479_CR21","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.ejor.2020.08.027","volume":"290","author":"P Dvurechensky","year":"2021","unstructured":"Dvurechensky P, Gorbunov E, Gasnikov A (2021) An accelerated directional derivative method for smooth stochastic convex optimization. Eur J Oper Res 290(2):601\u2013621","journal-title":"Eur J Oper Res"},{"key":"479_CR22","volume-title":"Stochastic programming methods","author":"Y Ermoliev","year":"1976","unstructured":"Ermoliev Y (1976) Stochastic programming methods. Nauka, Moscow"},{"key":"479_CR23","doi-asserted-by":"crossref","unstructured":"Forero PA, Cano A, Giannakis GB (2010) Consensus-based distributed linear support vector machines. In: Proceedings of the 9th ACM\/IEEE international conference on information processing in sensor networks, pp 35\u201346","DOI":"10.1145\/1791212.1791218"},{"key":"479_CR24","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1134\/S0005117917020035","volume":"78","author":"AV Gasnikov","year":"2017","unstructured":"Gasnikov AV, Krymova EA, Lagunovskaya AA, Usmanova IN, Fedorenko FA (2017) Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case. Autom Remote Control 78:224\u2013234","journal-title":"Autom Remote Control"},{"key":"479_CR25","doi-asserted-by":"crossref","unstructured":"Gasnikov A, Dvinskikh D, Dvurechensky P, Gorbunov E, Beznosikov A, Lobanov A (2022a) Randomized gradient-free methods in convex optimization. arXiv:2211.13566","DOI":"10.1007\/978-3-030-54621-2_859-1"},{"key":"479_CR26","unstructured":"Gasnikov A, Novitskii A, Novitskii V, Abdukhakimov F, Kamzolov D, Beznosikov A, Takac M, Dvurechensky P, Gu B (2022b) The power of first-order smooth optimization for black-box non-smooth problems. In: International conference on machine learning. PMLR, pp 7241\u20137265"},{"issue":"4","key":"479_CR27","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi S, Lan G (2012) Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: a generic algorithmic framework. SIAM J Optim 22(4):1469\u20131492","journal-title":"SIAM J Optim"},{"issue":"3","key":"479_CR28","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.automatica.2013.01.009","volume":"49","author":"P Giselsson","year":"2013","unstructured":"Giselsson P, Doan MD, Keviczky T, De Schutter B, Rantzer A (2013) Accelerated gradient methods and dual decomposition in distributed model predictive control. Automatica 49(3):829\u2013833","journal-title":"Automatica"},{"key":"479_CR29","first-page":"15042","volume":"33","author":"E Gorbunov","year":"2020","unstructured":"Gorbunov E, Danilova M, Gasnikov A (2020) Stochastic optimization with heavy-tailed noise via accelerated gradient clipping. Adv Neural Inf Process Syst 33:15042\u201315053","journal-title":"Adv Neural Inf Process Syst"},{"key":"479_CR01","doi-asserted-by":"crossref","unstructured":"Granichin ON et al (2023) B.T. Polyak\u2019s method based on stochastic Lyapunov function for justifying the validity of estimates of the search algorithm for stochastic approximation under unknown but bounded disturbances. Comput Math Math Phys","DOI":"10.1134\/S096554252470012X"},{"key":"479_CR30","unstructured":"Hern\u00e1ndez-Lobato JM, Hoffman MW, Ghahramani Z (2014) Predictive entropy search for efficient global optimization of black-box functions. Adv Neural Inf Process Syst 27"},{"key":"479_CR31","first-page":"94","volume":"4","author":"M Kolar","year":"2010","unstructured":"Kolar M, Song L, Ahmed A, Xing EP (2010) Estimating time-varying networks. Ann Appl Sta 4:94\u2013123","journal-title":"Ann Appl Sta"},{"key":"479_CR32","unstructured":"Kone\u010dn\u1ef3 J, McMahan HB, Yu FX, Richt\u00e1rik P, Suresh AT, Bacon D (2016) Federated learning: strategies for improving communication efficiency. arXiv:1610.05492"},{"key":"479_CR33","unstructured":"Kovalev D, Gasanov E, Gasnikov A, Richtarik P (2021a) Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks. Adv Neural Inf Process Syst 34:22325\u201322335"},{"key":"479_CR34","unstructured":"Kovalev D, Shulgin E, Richt\u00e1rik P, Rogozin AV, Gasnikov A (2021b) Adom: accelerated decentralized optimization method for time-varying networks. In: International conference on machine learning. PMLR, pp 5784\u20135793"},{"key":"479_CR35","unstructured":"Kovalev D, Gasanov E, Gasnikov A, Richtarik P (2021c) Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks. In: Advances in neural information processing systems, vol 34, pp 22325\u201322335"},{"key":"479_CR36","unstructured":"Kovalev D, Beznosikov A, Sadiev A, Persiianov M, Richt\u00e1rik P, Gasnikov A (2022) Optimal algorithms for decentralized stochastic variational inequalities. arXiv:2202.02771"},{"key":"479_CR37","unstructured":"Lattimore T, Gyorgy A (2021) Improved regret for zeroth-order stochastic convex bandits. In: Conference on learning theory. PMLR, pp 2938\u20132964"},{"key":"479_CR38","unstructured":"Li H, Lin Z (2021) Accelerated gradient tracking over time-varying graphs for decentralized optimization. arXiv:2104.02596"},{"key":"479_CR39","doi-asserted-by":"publisher","first-page":"4855","DOI":"10.1109\/TSP.2020.3018317","volume":"68","author":"H Li","year":"2020","unstructured":"Li H, Fang C, Yin W, Lin Z (2020) Decentralized accelerated gradient methods with increasing penalty parameters. IEEE Trans Signal Process 68:4855\u20134870","journal-title":"IEEE Trans Signal Process"},{"key":"479_CR40","unstructured":"Lian X, Zhang C, Zhang H, Hsieh C-J, Zhang W, Liu J (2017) Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent. Adv Neural Inf Process Syst 30"},{"key":"479_CR41","unstructured":"Liu Z, Koloskova A, Jaggi M, Lin T (2022) Decentralized stochastic optimization with client sampling. In: OPT 2022: optimization for machine learning (NeurIPS 2022 Workshop)"},{"key":"479_CR42","doi-asserted-by":"crossref","unstructured":"Lobanov A (2023) Stochastic adversarial noise in the \u201cblack box\u201d optimization problem. arXiv:2304.07861","DOI":"10.1007\/978-3-031-47859-8_5"},{"key":"479_CR43","doi-asserted-by":"crossref","unstructured":"Lobanov A, Alashqar B, Dvinskikh D, Gasnikov A (2022) Gradient-free federated learning methods with $$ l_1 $$ and $$ l_2 $$-randomization for non-smooth convex stochastic optimization problems. arXiv:2211.10783","DOI":"10.1134\/S0965542523090026"},{"key":"479_CR44","doi-asserted-by":"crossref","unstructured":"Lobanov A, Anikin A, Gasnikov A, Gornov A, Chukanov S (2023a) Zero-order stochastic conditional gradient sliding method for non-smooth convex optimization. arXiv:2303.02778","DOI":"10.1007\/978-3-031-43257-6_8"},{"key":"479_CR02","doi-asserted-by":"crossref","unstructured":"Lobanov A, Bashirov N, Gasnikov A (2023b) The black-box optimization prob- lem: Zero-order accelerated stochastic method via kernel approximation. arXiv:2310.02371","DOI":"10.1007\/s10957-024-02556-6"},{"key":"479_CR45","doi-asserted-by":"crossref","unstructured":"Lobanov A, Gasnikov A, Stonyakin F (2023c) Highly smoothness zero-order methods for solving optimization problems under pl condition. arXiv:2305.15828","DOI":"10.1134\/S0965542524700118"},{"key":"479_CR46","doi-asserted-by":"crossref","unstructured":"Maros M Jald\u00e9n J (2018) Panda: a dual linearly converging method for distributed optimization over time-varying undirected graphs. In: 2018 IEEE conference on decision and control (CDC). IEEE, pp 6520\u20136525","DOI":"10.1109\/CDC.2018.8619626"},{"key":"479_CR47","unstructured":"McMahan B, Moore E, Ramage D, Hampson S, Arcas BA (2017) Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. PMLR, pp 1273\u20131282"},{"issue":"11","key":"479_CR48","doi-asserted-by":"publisher","first-page":"5538","DOI":"10.1109\/TAC.2017.2690401","volume":"62","author":"A Nedi\u0107","year":"2017","unstructured":"Nedi\u0107 A, Olshevsky A, Uribe CA (2017) Fast convergence rates for distributed non-Bayesian learning. IEEE Trans Autom Control 62(11):5538\u20135553","journal-title":"IEEE Trans Autom Control"},{"issue":"4","key":"479_CR49","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1137\/16M1084316","volume":"27","author":"A Nedic","year":"2017","unstructured":"Nedic A, Olshevsky A, Shi W (2017) Achieving geometric convergence for distributed optimization over time-varying graphs. SIAM J Optim 27(4):2597\u20132633","journal-title":"SIAM J Optim"},{"key":"479_CR50","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov Y, Spokoiny V (2017) Random gradient-free minimization of convex functions. Found Comput Math 17:527\u2013566","journal-title":"Found Comput Math"},{"issue":"3","key":"479_CR51","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/ijoo.2022.0085","volume":"5","author":"A Nguyen","year":"2022","unstructured":"Nguyen A, Balasubramanian K (2022) Stochastic zeroth-order functional constrained optimization: oracle complexity and applications. INFORMS J Optim 5(3):256\u2013272","journal-title":"INFORMS J Optim"},{"key":"479_CR52","doi-asserted-by":"crossref","unstructured":"Novitskii V, Gasnikov A (2021) Improved exploiting higher order smoothness in derivative-free optimization and continuous bandit. arXiv:2101.03821","DOI":"10.1007\/s11590-022-01863-z"},{"issue":"2","key":"479_CR03","first-page":"45","volume":"26","author":"BT Polyak","year":"1990","unstructured":"Polyak BT, Tsybakov AB (1990) Optimal order of accuracy of search algorithms in stochastic optimization. Probl Peredachi Informatsii 26(2):45\u201353","journal-title":"Probl Peredachi Informatsii"},{"issue":"6","key":"479_CR53","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1109\/TAC.2019.2937496","volume":"65","author":"G Qu","year":"2019","unstructured":"Qu G, Li N (2019) Accelerated distributed Nesterov gradient descent. IEEE Trans Autom Control 65(6):2566\u20132581","journal-title":"IEEE Trans Autom Control"},{"key":"479_CR54","doi-asserted-by":"crossref","unstructured":"Rabbat M, Nowak R (2004) Distributed optimization in sensor networks. In: Proceedings of the 3rd international symposium on information processing in sensor networks, pp 20\u201327","DOI":"10.1145\/984622.984626"},{"key":"479_CR55","unstructured":"Radford A, Kim JW, Hallacy C, Ramesh A, Goh G, Agarwal S, Sastry G, Askell A, Mishkin P, Clark J et al (2021) Learning transferable visual models from natural language supervision. In: International conference on machine learning. PMLR, pp 8748\u20138763"},{"key":"479_CR56","unstructured":"Ramesh A, Pavlov M, Goh G, Gray S, Voss C, Radford A, Chen M, Sutskever I (2021) Zero-shot text-to-image generation. In: International conference on machine learning. PMLR, pp 8821\u20138831"},{"issue":"1\u20132","key":"479_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik P, Tak\u00e1\u010d M (2014) Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math Program 144(1\u20132):1\u201338","journal-title":"Math Program"},{"key":"479_CR58","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins H, Monro S (1951) A stochastic approximation method. Ann Math Stat 22:400\u2013407","journal-title":"Ann Math Stat"},{"key":"479_CR59","unstructured":"Rogozin A, Gasnikov A, Beznosikov A, Kovalev D (2022) Decentralized optimization over time-varying graphs: a survey. arXiv:2210.09719"},{"issue":"159","key":"479_CR60","first-page":"1","volume":"20","author":"K Scaman","year":"2019","unstructured":"Scaman K, Bach F, Bubeck S, Lee YT, Massouli\u00e9 L (2019) Optimal convergence rates for convex distributed optimization in networks. J Mach Learn Res 20(159):1\u201331","journal-title":"J Mach Learn Res"},{"issue":"1","key":"479_CR61","first-page":"1703","volume":"18","author":"O Shamir","year":"2017","unstructured":"Shamir O (2017) An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. J Mach Learn Res 18(1):1703\u20131713","journal-title":"J Mach Learn Res"},{"key":"479_CR62","unstructured":"Stepanov I, Voronov A, Beznosikov A, Gasnikov A (2021) One-point gradient-free methods for composite optimization with applications to distributed optimization. arXiv:2107.05951"},{"key":"479_CR63","unstructured":"Stich SU (2019) Unified optimal analysis of the (stochastic) gradient method. arXiv:1907.04232"},{"key":"479_CR64","unstructured":"Stich S, Mohtashami A, Jaggi M (2021) Critical parameters for scalable distributed learning with large batches and asynchronous updates. In: International conference on artificial intelligence and statistics. PMLR, pp 4042\u20134050"},{"key":"479_CR65","unstructured":"Tang H, Lian X, Yan M, Zhang C, Liu J (2018) $${D}^{2}$$: decentralized training over decentralized data. In: International conference on machine learning. PMLR, pp 4848\u20134856"},{"key":"479_CR66","unstructured":"Touvron H, Lavril T, Izacard G, Martinet X, Lachaux M-A, Lacroix T, Rozi\u00e8re B, Goyal N, Hambro E, Azhar F et al (2023) Llama: open and efficient foundation language models. arXiv:2302.13971"},{"issue":"6","key":"479_CR67","first-page":"2574","volume":"34","author":"M Wang","year":"2020","unstructured":"Wang M, Fu W, He X, Hao S, Wu X (2020) A survey on large-scale machine learning. IEEE Trans Knowl Data Eng 34(6):2574\u20132594","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"479_CR68","first-page":"9841","volume":"35","author":"B Wang","year":"2022","unstructured":"Wang B, Safaryan M, Richt\u00e1rik P (2022) Theoretically better and numerically faster distributed optimization with smoothness-aware quantization techniques. Adv Neural Inf Process Syst 35:9841\u20139852","journal-title":"Adv Neural Inf Process Syst"},{"key":"479_CR70","unstructured":"Woodworth B, Patel KK, Stich S, Dai Z, Bullins B, Mcmahan B, Shamir O, Srebro N (2020) Is local SGD better than minibatch SGD? In: International conference on machine learning. PMLR, pp 10334\u201310343"},{"key":"479_CR69","doi-asserted-by":"crossref","unstructured":"Woodworth BE, Bullins B, Shamir O, Srebro N (2021) The min\u2013max complexity of distributed stochastic convex optimization with intermittent communication. In: Conference on learning theory. PMLR, pp 4386\u20134437","DOI":"10.24963\/ijcai.2022\/751"},{"issue":"1","key":"479_CR71","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright SJ (2015) Coordinate descent algorithms. Math Program 151(1):3\u201334","journal-title":"Math Program"},{"issue":"1","key":"479_CR72","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.jpdc.2006.08.010","volume":"67","author":"L Xiao","year":"2007","unstructured":"Xiao L, Boyd S, Kim S-J (2007) Distributed average consensus with least-mean-square deviation. J Parallel Distrib Comput 67(1):33\u201346","journal-title":"J Parallel Distrib Comput"},{"key":"479_CR73","unstructured":"Ye H, Luo L, Zhou Z, Zhang T (2020) Multi-consensus decentralized accelerated gradient descent. arXiv:2005.00797"},{"key":"479_CR74","unstructured":"Yu H, Jin R, Yang S (2019) On the linear speedup analysis of communication efficient momentum SGD for distributed non-convex optimization. In: International conference on machine learning. PMLR, pp 7184\u20137193"},{"issue":"10","key":"479_CR75","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1109\/JRPROC.1961.287688","volume":"49","author":"LA Zadeh","year":"1961","unstructured":"Zadeh LA (1961) Time-varying networks, I. Proc IRE 49(10):1488\u20131503","journal-title":"Proc IRE"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00479-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T18:01:52Z","timestamp":1730397712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00479-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,24]]},"references-count":78,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00479-7","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,24]]},"assertion":[{"value":"30 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"48"}}