{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:20Z","timestamp":1740123980939,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071234"],"award-info":[{"award-number":["12071234"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10957-024-02552-w","type":"journal-article","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T09:16:25Z","timestamp":1730106985000},"page":"2908-2953","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Distributed Accelerated Algorithm Based on a Unified Momentum Method"],"prefix":"10.1007","volume":"203","author":[{"given":"Yawei","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4806-7605","authenticated-orcid":false,"given":"Qingzhi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,28]]},"reference":[{"issue":"8","key":"2552_CR1","doi-asserted-by":"publisher","first-page":"4289","DOI":"10.1109\/TSP.2012.2198470","volume":"60","author":"JS Chen","year":"2012","unstructured":"Chen, J.S., Sayed, A.H.: Diffusion adaptation strategies for distributed optimization and learning over networks. IEEE Trans. Signal Process. 60(8), 4289\u20134305 (2012). https:\/\/doi.org\/10.1109\/TSP.2012.2198470","journal-title":"IEEE Trans. Signal Process."},{"issue":"7","key":"2552_CR2","doi-asserted-by":"publisher","first-page":"3658","DOI":"10.1109\/TAC.2017.2673411","volume":"62","author":"XW Dong","year":"2017","unstructured":"Dong, X.W., Hu, G.Q.: Time-varying formation tracking for linear multiagent systems with multiple leaders. IEEE Trans. Autom. Control. 62(7), 3658\u20133664 (2017). https:\/\/doi.org\/10.1109\/TAC.2017.2673411","journal-title":"IEEE Trans. Autom. Control."},{"issue":"2","key":"2552_CR3","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1109\/TAC.2022.3160684","volume":"68","author":"J Gao","year":"2023","unstructured":"Gao, J., Liu, X.W., Dai, Y.H., Huang, Y.K., Yang, P.: A family of distributed momentum methods over directed graphs with linear convergence. IEEE Trans. Autom. Control 68(2), 1085\u20131092 (2023). https:\/\/doi.org\/10.1109\/TAC.2022.3160684","journal-title":"IEEE Trans. Autom. Control"},{"key":"2552_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York (2012)"},{"key":"2552_CR5","doi-asserted-by":"publisher","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, USA (2003) https:\/\/doi.org\/10.1109\/SFCS.2003.1238221","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"2552_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10107-015-0949-3","volume":"159","author":"D Kim","year":"2016","unstructured":"Kim, D., Fessler, J.A.: Optimized first-order methods for smooth convex minimization. Math. Program. 159, 81\u2013107 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0949-3","journal-title":"Math. Program."},{"issue":"2","key":"2552_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/JSTSP.2013.2247023","volume":"7","author":"S Lee","year":"2013","unstructured":"Lee, S., Nedic, A.: Distributed random projection algorithm for convex optimization. IEEE J. Sel. Top. Signal Process. 7(2), 221\u2013229 (2013). https:\/\/doi.org\/10.1109\/JSTSP.2013.2247023","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"10","key":"2552_CR8","doi-asserted-by":"publisher","first-page":"6258","DOI":"10.1109\/TSMC.2019.2960770","volume":"51","author":"QG Lu","year":"2021","unstructured":"Lu, Q.G., Liao, X.F., Li, H.Q., Huang, T.W.: A Nesterov-like gradient tracking algorithm for distributed optimization over directed networks. IEEE Trans. Syst. Man Cybern. Syst. 51(10), 6258\u20136270 (2021). https:\/\/doi.org\/10.1109\/TSMC.2019.2960770","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"1","key":"2552_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"54","author":"A Nedic","year":"2009","unstructured":"Nedic, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 54(1), 48\u201361 (2009). https:\/\/doi.org\/10.1109\/TAC.2008.2009515","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"2552_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TAC.2014.2364096","volume":"60","author":"A Nedic","year":"2015","unstructured":"Nedic, A., Olshevsky, A.: Distributed optimization over time-varying directed graphs. IEEE Trans. Autom. Control 60(3), 601\u2013615 (2015). https:\/\/doi.org\/10.1109\/TAC.2014.2364096","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"2552_CR11","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$O(1\/k^2)$$. Soviet Math. Doklady 269(3), 543\u2013547 (1983)","journal-title":"Soviet Math. Doklady"},{"key":"2552_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer Science and Business Media, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-8853-9"},{"issue":"9","key":"2552_CR13","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.1109\/TAC.2004.834113","volume":"49","author":"R Olfati-Saber","year":"2004","unstructured":"Olfati-Saber, R., Murray, R.M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans. Autom. Control 49(9), 1520\u20131533 (2004). https:\/\/doi.org\/10.1109\/TAC.2004.834113","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"2552_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964). https:\/\/doi.org\/10.1016\/0041-5553(64)90137-5","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2552_CR15","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"issue":"3","key":"2552_CR16","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TCNS.2017.2698261","volume":"5","author":"GN Qu","year":"2018","unstructured":"Qu, G.N., Li, N.: Harnessing smoothness to accelerate distributed optimization. IEEE Trans. Control Netw. Syst. 5(3), 1245\u20131260 (2018). https:\/\/doi.org\/10.1109\/TCNS.2017.2698261","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"2552_CR17","doi-asserted-by":"publisher","unstructured":"Ram, S.S., Nedic, A., Veeravalli, V.V.: Distributed subgradient projection algorithm for convex optimization. In: Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, Taipei, Taiwan (2009) https:\/\/doi.org\/10.1109\/ICASSP.2009.4960418","DOI":"10.1109\/ICASSP.2009.4960418"},{"issue":"1","key":"2552_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/LCSYS.2017.2722406","volume":"2","author":"BV Scoy","year":"2018","unstructured":"Scoy, B.V., Freeman, R.A., Lynch, K.M.: The fastest known globally convergent first-order method for minimizing strongly convex functions. IEEE Control Syst. Lett. 2(1), 49\u201354 (2018). https:\/\/doi.org\/10.1109\/LCSYS.2017.2722406","journal-title":"IEEE Control Syst. Lett."},{"issue":"2","key":"2552_CR19","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1137\/14096668X","volume":"25","author":"W Shi","year":"2015","unstructured":"Shi, W., Ling, Q., Wu, G., Yin, W.T.: EXTRA: An exact first-order algorithm for decentralized consensus optimization. SIAM J. Optim. 25(2), 944\u2013966 (2015). https:\/\/doi.org\/10.1137\/14096668X","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2552_CR20","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1109\/JSTSP.2011.2118740","volume":"5","author":"K Srivastava","year":"2011","unstructured":"Srivastava, K., Nedic, A.: Distributed asynchronous constrained stochastic optimization. IEEE J. Sel. Top. Signal Process. 5(4), 772\u2013790 (2011). https:\/\/doi.org\/10.1109\/JSTSP.2011.2118740","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"8","key":"2552_CR21","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1109\/TCYB.2016.2613129","volume":"47","author":"SN Wang","year":"2017","unstructured":"Wang, S.N., Li, C.G.: Distributed robust optimization in networked system. IEEE Trans. Cybern. 47(8), 2321\u20132333 (2017). https:\/\/doi.org\/10.1109\/TCYB.2016.2613129","journal-title":"IEEE Trans. Cybern."},{"issue":"10","key":"2552_CR22","doi-asserted-by":"publisher","first-page":"4980","DOI":"10.1109\/TAC.2017.2672698","volume":"62","author":"CG Xi","year":"2017","unstructured":"Xi, C.G., Khan, U.A.: DEXTRA: a fast algorithm for optimization over directed graphs. IEEE Trans. Autom. Control 62(10), 4980\u20134993 (2017). https:\/\/doi.org\/10.1109\/TAC.2017.2672698","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"2552_CR23","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1109\/TAC.2017.2737582","volume":"63","author":"CG Xi","year":"2018","unstructured":"Xi, C.G., Xin, R., Khan, U.A.: ADD-OPT: accelerated distributed directed optimization. IEEE Trans. Autom. Control. 63(5), 1329\u20131339 (2018). https:\/\/doi.org\/10.1109\/TAC.2017.2737582","journal-title":"IEEE Trans. Autom. Control."},{"key":"2552_CR24","doi-asserted-by":"publisher","unstructured":"Xiao, L., Boyd, S.: Fast linear iterations for distributed averaging. In: Proceedings of the 42nd IEEE International Conference on Decision and Control, Maui, HI USA (2003) https:\/\/doi.org\/10.1109\/CDC.2003.1272421","DOI":"10.1109\/CDC.2003.1272421"},{"issue":"3","key":"2552_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/LCSYS.2018.2834316","volume":"2","author":"R Xin","year":"2018","unstructured":"Xin, R., Khan, U.A.: A linear algorithm for optimization over directed graphs with geometric convergence. IEEE Control Syst. Lett. 2(3), 315\u2013320 (2018). https:\/\/doi.org\/10.1109\/LCSYS.2018.2834316","journal-title":"IEEE Control Syst. Lett."},{"issue":"1","key":"2552_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13634-018-0596-y","volume":"2019","author":"R Xin","year":"2019","unstructured":"Xin, R., Xi, C.G., Khan, U.A.: FROST-Fast row-stochastic optimization with uncoordinated step-sizes. EURASIP J. Adv. Signal Process. 2019(1), 1\u201314 (2019). https:\/\/doi.org\/10.1186\/s13634-018-0596-y","journal-title":"EURASIP J. Adv. Signal Process."},{"issue":"8","key":"2552_CR27","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/LSP.2019.2925537","volume":"26","author":"R Xin","year":"2019","unstructured":"Xin, R., Jakovetic, D., Khan, U.A.: Distributed Nesterov gradient methods over arbitrary graphs. IEEE Signal Process. Lett. 26(8), 1247\u20131251 (2019). https:\/\/doi.org\/10.1109\/LSP.2019.2925537","journal-title":"IEEE Signal Process. Lett."},{"issue":"6","key":"2552_CR28","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1109\/TAC.2019.2942513","volume":"65","author":"R Xin","year":"2020","unstructured":"Xin, R., Khan, U.A.: Distributed heavy-ball: a generalization and acceleration of first-order methods with gradient tracking. IEEE Trans. Autom. Control 65(6), 2627\u20132633 (2020). https:\/\/doi.org\/10.1109\/TAC.2019.2942513","journal-title":"IEEE Trans. Autom. Control"},{"key":"2552_CR29","doi-asserted-by":"publisher","unstructured":"Xu, J.M., Zhu, S.Y., Soh, Y.C., Xie, L.H.: Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes. In: Proceedings of the 2015 54th IEEE Conference on Decision and Control, Osaka, Japan (2015) https:\/\/doi.org\/10.1109\/CDC.2015.7402509","DOI":"10.1109\/CDC.2015.7402509"},{"key":"2552_CR30","doi-asserted-by":"publisher","unstructured":"Yang, T.B., Lin, Q.H., Li, Z.: Unified convergence analysis of stochastic momentum methods for convex and non-convex optimization. https:\/\/doi.org\/10.48550\/arXiv.1604.03257","DOI":"10.48550\/arXiv.1604.03257"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02552-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02552-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02552-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:08:24Z","timestamp":1733746104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02552-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,28]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2552"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02552-w","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2024,10,28]]},"assertion":[{"value":"6 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors have no Conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}