{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:23:07Z","timestamp":1723335787123},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10898-024-01395-z","type":"journal-article","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T09:02:23Z","timestamp":1713949343000},"page":"153-215","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed accelerated gradient methods with restart under quadratic growth condition"],"prefix":"10.1007","volume":"90","author":[{"given":"Chhavi","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vishnu","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Balamurugan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,24]]},"reference":[{"key":"1395_CR1","unstructured":"Li, B., Cen, S., Chen, Y., Chi, Y.: Communication-efficient distributed optimization in networks with gradient tracking and variance reduction. In: International Conference on Artificial Intelligence and Statistics, pp. 1662\u20131672. PMLR (2020)"},{"key":"1395_CR2","first-page":"18308","volume":"33","author":"H Ye","year":"2020","unstructured":"Ye, H., Zhou, Z., Luo, L., Zhang, T.: Decentralized accelerated proximal gradient descent. Adv. Neural. Inf. Process. Syst. 33, 18308 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"1","key":"1395_CR3","first-page":"236","volume":"19","author":"T Yang","year":"2018","unstructured":"Yang, T., Lin, Q.: Rsg: beating subgradient method without smoothness and strong convexity. J. Mach. Learn. Res. 19(1), 236\u2013268 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"1395_CR4","unstructured":"Liu, M., Yang, T.: Adaptive accelerated gradient converging method under H\u00f6lderian error bound condition. In: Advances in Neural Information Processing Systems, pp. 3104\u20133114 (2017)"},{"key":"1395_CR5","unstructured":"Xu, Y., Lin, Q., Yang, T.: Adaptive SVRG methods under error bound conditions with unknown growth parameter. In: Advances in Neural Information Processing Systems, pp. 3277\u20133287 (2017)"},{"issue":"2","key":"1395_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165(2), 471\u2013507 (2017)","journal-title":"Math. Program."},{"issue":"5","key":"1395_CR7","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/TAC.2014.2298712","volume":"59","author":"D Jakovetic","year":"2014","unstructured":"Jakovetic, D., Xavier, J.M.F., Moura, J.M.F.: Fast distributed gradient methods. IEEE Trans. Autom. Control 59(5), 1131\u20131146 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1395_CR8","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.: Decentralized accelerated gradient methods with increasing penalty parameters. IEEE Trans. Signal Process. 68, 4855 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"1395_CR9","doi-asserted-by":"crossref","unstructured":"Qu, G., Li, N.: Accelerated distributed Nesterov gradient descent. arXiv preprints arXiv:1706.05671 (2017)","DOI":"10.1109\/CDC.2017.8263979"},{"issue":"220","key":"1395_CR10","first-page":"1","volume":"23","author":"A Fallah","year":"2022","unstructured":"Fallah, A., G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., \u015eim\u015eekli, U., Zhu, L.: Robust distributed accelerated stochastic gradient methods for multi-agent networks. J. Mach. Learn. Res. 23(220), 1\u201396 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"1395_CR11","first-page":"1458","volume":"24","author":"M Schmidt","year":"2011","unstructured":"Schmidt, M., Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. Adv. Neural Inf. Process. Syst. 24, 1458\u20131466 (2011)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1395_CR12","doi-asserted-by":"crossref","unstructured":"Jakoveti\u0107, D., Moura, M.F., Xavier, J.: Distributed Nesterov-like gradient algorithms. In: 2012 IEEE 51st Annual Conference on Decision and Control (CDC), IEEE (2012)","DOI":"10.1109\/CDC.2012.6425938"},{"key":"1395_CR13","first-page":"1","volume":"20","author":"K Scaman","year":"2019","unstructured":"Scaman, K., Bach, F., Bubeck, S., Lee, Y., Massouli\u00e9, L.: Optimal convergence rates for convex distributed optimization in networks. J. Mach. Learn. Res. 20, 1\u201331 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"22","key":"1395_CR14","doi-asserted-by":"publisher","first-page":"6013","DOI":"10.1109\/TSP.2015.2461520","volume":"63","author":"W Shi","year":"2015","unstructured":"Shi, W., Ling, Q., Wu, G., Yin, W.: A proximal gradient algorithm for decentralized composite optimization. IEEE Trans. Signal Process. 63(22), 6013\u20136023 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"1395_CR15","unstructured":"Xu, Y., Lin, Q., Yang, T.: Stochastic convex optimization: faster local growth implies faster global convergence. In: International Conference on Machine Learning, pp. 3821\u20133830. PMLR (2017)"},{"issue":"4","key":"1395_CR16","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.automatica.2013.01.029","volume":"49","author":"M Franceschelli","year":"2013","unstructured":"Franceschelli, M., Gasparri, A., Giua, A., Seatzu, C.: Decentralized estimation of Laplacian eigenvalues in multi-agent systems. Automatica 49(4), 1031\u20131036 (2013)","journal-title":"Automatica"},{"issue":"1","key":"1395_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/060678324","volume":"48","author":"A Olshevsky","year":"2009","unstructured":"Olshevsky, A., Tsitsiklis, J.N.: Convergence speed in distributed consensus and averaging. SIAM J. Control. Optim. 48(1), 33\u201355 (2009)","journal-title":"SIAM J. Control. Optim."},{"issue":"2","key":"1395_CR18","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.arcontrol.2011.10.005","volume":"35","author":"J Liu","year":"2011","unstructured":"Liu, J., Morse, A.S.: Accelerated linear iterations for distributed averaging. Annu. Rev. Control. 35(2), 160\u2013165 (2011)","journal-title":"Annu. Rev. Control."},{"issue":"1","key":"1395_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-011-0481-z","volume":"137","author":"G Li","year":"2013","unstructured":"Li, G.: Global error bounds for piecewise convex polynomials. Math. Program. 137(1), 37\u201364 (2013)","journal-title":"Math. Program."},{"issue":"67\u201368","key":"1395_CR20","first-page":"7","volume":"35","author":"S Wright","year":"1999","unstructured":"Wright, S., Nocedal, J., et al.: Numerical optimization. Science 35(67\u201368), 7 (1999)","journal-title":"Science"},{"key":"1395_CR21","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $${O}(1\/k^2)$$. Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"issue":"1","key":"1395_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Image Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Image Sci."},{"key":"1395_CR23","doi-asserted-by":"publisher","unstructured":"Beck, A.: First-order methods in optimization. In: Society for Industrial and Applied Mathematics, Philadelphia (2017). https:\/\/doi.org\/10.1137\/1.9781611974997","DOI":"10.1137\/1.9781611974997"},{"issue":"1\u20132","key":"1395_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","volume":"168","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Chbani, Z., Peypouquet, J., Redont, P.: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Program. 168(1\u20132), 123\u2013175 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"1395_CR25","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than $$1\/k^{2}$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"key":"1395_CR26","unstructured":"Gong, P., Ye, J.: Linear convergence of variance-reduced projected stochastic gradient without strong convexity. arXiv preprint arXiv:1406.1102 (2014)"},{"key":"1395_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019)","journal-title":"Math. Program."},{"key":"1395_CR28","doi-asserted-by":"crossref","unstructured":"Chen, A.I., Ozdaglar, A.: A fast distributed proximal-gradient method. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 601\u2013608 (2012)","DOI":"10.1109\/Allerton.2012.6483273"},{"issue":"1","key":"1395_CR29","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)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1395_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach Learn."},{"issue":"2","key":"1395_CR31","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.: Extra: an exact first-order algorithm for decentralized consensus optimization. SIAM J. Optim. 25(2), 944\u2013966 (2015)","journal-title":"SIAM J. Optim."},{"key":"1395_CR32","first-page":"1","volume":"29","author":"NS Aybat","year":"2016","unstructured":"Aybat, N.S., Yazdandoost Hamedani, E.: A primal-dual method for conic constrained distributed optimization problems. Adv. Neural Inf. Process. Syst. 29, 1 (2016)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"11","key":"1395_CR33","doi-asserted-by":"publisher","first-page":"5682","DOI":"10.1109\/TAC.2021.3130082","volume":"67","author":"EY Hamedani","year":"2021","unstructured":"Hamedani, E.Y., Aybat, N.S.: A decentralized primal\u2013dual method for constrained minimization of a strongly convex function. IEEE Trans. Autom. Control 67(11), 5682\u20135697 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1395_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TAC.2017.2713046","volume":"63","author":"NS Aybat","year":"2017","unstructured":"Aybat, N.S., Wang, Z., Lin, T., Ma, S.: Distributed linearized alternating direction method of multipliers for composite convex consensus optimization. IEEE Trans. Autom. Control 63(1), 5\u201320 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1395_CR35","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2016","unstructured":"Condat, L.: Fast projection onto the simplex and the $$\\ell _1$$ ball. Math. Program. 158(1), 575\u2013585 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1395_CR36","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1137\/03060062X","volume":"26","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Raydan, M.: Robust stopping criteria for Dykstra\u2019s algorithm. SIAM J. Sci. Comput. 26(4), 1405\u20131414 (2005)","journal-title":"SIAM J. Sci. Comput."},{"key":"1395_CR37","doi-asserted-by":"crossref","unstructured":"Ram, S.S., Nedic, A., Veeravalli, V.V.: Distributed subgradient projection algorithm for convex optimization. In: 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3653\u20133656. IEEE (2009)","DOI":"10.1109\/ICASSP.2009.4960418"},{"issue":"4","key":"1395_CR38","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TSP.2013.2291221","volume":"62","author":"D Jakovetic","year":"2014","unstructured":"Jakovetic, D., Xavier, J.M.F., Moura, J.M.F.: Convergence rates of distributed Nesterov-like gradient methods on random networks. IEEE Trans. Signal Process. 62(4), 868\u2013882 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1395_CR39","first-page":"1","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Adv. Neural Inf. Process. Syst. 26, 1 (2013)","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01395-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01395-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01395-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T08:14:51Z","timestamp":1723277691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01395-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,24]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1395"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01395-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2024,4,24]]},"assertion":[{"value":"8 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 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":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}