{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:22:25Z","timestamp":1775578945544,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIF 1564044"],"award-info":[{"award-number":["CIF 1564044"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIF 1719205"],"award-info":[{"award-number":["CIF 1719205"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER Award 1555850"],"award-info":[{"award-number":["CAREER Award 1555850"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-16-1-2244"],"award-info":[{"award-number":["N00014-16-1-2244"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e1 e della Ricerca","doi-asserted-by":"publisher","award":["PLATINO PON PON01_01007"],"award-info":[{"award-number":["PLATINO PON PON01_01007"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"crossref","award":["17-26999S"],"award-info":[{"award-number":["17-26999S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10107-019-01408-w","type":"journal-article","created":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T04:46:09Z","timestamp":1560573969000},"page":"121-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Asynchronous parallel algorithms for nonconvex optimization"],"prefix":"10.1007","volume":"184","author":[{"given":"Loris","family":"Cannelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7714-1210","authenticated-orcid":false,"given":"Francisco","family":"Facchinei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vyacheslav","family":"Kungurtsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gesualdo","family":"Scutari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"issue":"2","key":"1408_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/322063.322067","volume":"25","author":"GM Baudet","year":"1978","unstructured":"Baudet, G.M.: Asynchronous iterative methods for multiprocessors. JACM 25(2), 226\u2013244 (1978)","journal-title":"JACM"},{"key":"1408_CR2","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods, vol. 23. Prentice-Hall Englewood Cliffs, NJ (1989)"},{"key":"1408_CR3","doi-asserted-by":"crossref","unstructured":"Cannelli, L., Facchinei, F., Kungurtsev, V., Scutari, G.: Asynchronous parallel algorithms for nonconvex big-data optimization\u2014part i: Model and convergence. arXiv preprint arXiv:1607.04818 (2016)","DOI":"10.1109\/ACSSC.2016.7869520"},{"key":"1408_CR4","doi-asserted-by":"crossref","unstructured":"Cannelli, L., Facchinei, F., Kungurtsev, V., Scutari, G.: Asynchronous parallel algorithms for nonconvex big-data optimization. Part ii: Complexity and numerical results. arXiv preprint arXiv:1701.04900 (2017)","DOI":"10.1109\/ACSSC.2016.7869520"},{"key":"1408_CR5","doi-asserted-by":"crossref","unstructured":"Cannelli, L., Facchinei, F., Kungurtsev, V., Scutari, G.: Asynchronous parallel nonconvex large-scale optimization. In: 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4706\u20134710 (2017)","DOI":"10.1109\/ICASSP.2017.7953049"},{"key":"1408_CR6","doi-asserted-by":"crossref","unstructured":"Cannelli, L., Scutari, G., Facchinei, F., Kungurtsev, V.: Parallel asynchronous lock-free algorithms for nonconvex big-data optimization. In: 2016 50th Asilomar Conference on Signals, Systems and Computers, pp. 1009\u20131013 (2016)","DOI":"10.1109\/ACSSC.2016.7869520"},{"issue":"2","key":"1408_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0024-3795(69)90028-7","volume":"2","author":"D Chazan","year":"1969","unstructured":"Chazan, D., Miranker, W.: Chaotic relaxation. Linear Algebra Appl. 2(2), 199\u2013222 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"15","key":"1408_CR8","doi-asserted-by":"crossref","first-page":"3914","DOI":"10.1109\/TSP.2015.2436357","volume":"63","author":"A Daneshmand","year":"2015","unstructured":"Daneshmand, A., Facchinei, F., Kungurtsev, V., Scutari, G.: Hybrid random\/deterministic parallel algorithms for convex and nonconvex big data optimization. IEEE Trans. Signal Process. 63(15), 3914\u20133929 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"1408_CR9","unstructured":"Davis, D.: The asynchronous palm algorithm for nonsmooth nonconvex problems. arXiv preprint arXiv:1604.00526 (2016)"},{"key":"1408_CR10","unstructured":"Davis, D., Edmunds, B., Udell, M.: The sound of APALM clapping: Faster nonsmooth nonconvex optimization with stochastic asynchronous palm. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems 29. Curran Associates, Inc., pp. 226\u2013234 (2016)"},{"key":"1408_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2010","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"1408_CR12","first-page":"1","volume":"164","author":"F Facchinei","year":"2016","unstructured":"Facchinei, F., Lampariello, L., Scutari, G.: Feasible methods for nonconvex nonsmooth problems with applications in green communications. Math. Program. 164(1), 1\u201336 (2016)","journal-title":"Math. Program."},{"issue":"7","key":"1408_CR13","doi-asserted-by":"crossref","first-page":"1874","DOI":"10.1109\/TSP.2015.2399858","volume":"63","author":"F Facchinei","year":"2015","unstructured":"Facchinei, F., Scutari, G., Sagratella, S.: Parallel selective algorithms for nonconvex big data optimization. IEEE Trans. Signal Process. 63(7), 1874\u20131889 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1408_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0377-0427(00)00409-X","volume":"123","author":"A Frommer","year":"2000","unstructured":"Frommer, A., Szyld, D.B.: On asynchronous iterations. J. Comput. Appl. Math. 123(1), 201\u2013216 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"1408_CR15","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1109\/TCNS.2017.2657460","volume":"5","author":"M Hong","year":"2018","unstructured":"Hong, M.: A distributed, asynchronous and incremental algorithm for nonconvex optimization: an ADMM approach. IEEE Trans. Control Netw. Syst. 5(3), 935\u2013945 (2018)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"1408_CR16","doi-asserted-by":"crossref","unstructured":"Huo, Z., Huang, H.: Asynchronous stochastic gradient descent with variance reduction for non-convex optimization. arXiv preprint arXiv:1604.03584 (2016)","DOI":"10.1609\/aaai.v31i1.10940"},{"key":"1408_CR17","doi-asserted-by":"crossref","unstructured":"Iutzeler, F., Bianchi, P., Ciblat, P., Hachem, W.: Asynchronous distributed optimization using a randomized alternating direction method of multipliers. In: 52nd IEEE Conference on Decision and Control, pp. 3671\u20133676 (2013)","DOI":"10.1109\/CDC.2013.6760448"},{"key":"1408_CR18","volume-title":"Probability Theory: A Comprehensive Course","author":"A Klenke","year":"2013","unstructured":"Klenke, A.: Probability Theory: A Comprehensive Course. Springer, Berlin (2013)"},{"key":"1408_CR19","unstructured":"Leblond, R., Pedregosa, F., Lacoste-Julien, S.: ASAGA: asynchronous parallel SAGA. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, pp. 46\u201354 (2017)"},{"key":"1408_CR20","unstructured":"Lian, X., Huang, Y., Li, Y., Liu, J.: Asynchronous parallel stochastic gradient for nonconvex optimization. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems 28. Curran Associates, Inc., pp. 2719\u20132727 (2015)"},{"issue":"1","key":"1408_CR21","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/140961134","volume":"25","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S.J.: Asynchronous stochastic coordinate descent: parallelism and convergence properties. SIAM J. Optim. 25(1), 351\u2013376 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1408_CR22","first-page":"285","volume":"16","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S.J., R\u00e9, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. J. Mach. Learn. Res. 16(1), 285\u2013322 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1408_CR23","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1137\/16M1057000","volume":"27","author":"H Mania","year":"2017","unstructured":"Mania, H., Pan, X., Papailiopoulos, D., Recht, B., Ramchandran, K., Jordan, M.I.: Perturbed iterate analysis for asynchronous stochastic optimization. SIAM J. Optim. 27(4), 2202\u20132229 (2017)","journal-title":"SIAM J. Optim."},{"issue":"C","key":"1408_CR24","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S1570-579X(01)80023-9","volume":"8","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P., Borkar, V.S.: Distributed asynchronous incremental subgradient methods. Stud. Comput. Math. 8(C), 381\u2013407 (2001)","journal-title":"Stud. Comput. Math."},{"key":"1408_CR25","unstructured":"Niu, F., Recht, B., Re, C., Wright, S.J.: Hogwild: a lock-free approach to parallelizing stochastic gradient descent. In: Shawe-Taylor, J., Zemel, R.S., Bartlett, P.L., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 24. Curran Associates, Inc., pp. 693\u2013701 (2011)"},{"key":"1408_CR26","unstructured":"Pedregosa, F., Leblond, R., Lacoste-Julien, S.: Breaking the nonsmooth barrier: a scalable parallel method for composite optimization. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems 30. Curran Associates, Inc., pp. 56\u201365 (2017)"},{"issue":"5","key":"1408_CR27","doi-asserted-by":"crossref","first-page":"A2851","DOI":"10.1137\/15M1024950","volume":"38","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: Arock: an algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38(5), A2851\u2013A2879 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1408_CR28","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s40305-017-0183-1","volume":"7","author":"Z Peng","year":"2019","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: On the convergence of asynchronous parallel iteration with unbounded delays. J. Oper. Res. Soc. China 7(1), 5\u201342 (2019)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1408_CR29","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Herbert Robbins Selected Papers, pp. 111\u2013135 (1985)","DOI":"10.1007\/978-1-4612-5110-1_10"},{"issue":"8","key":"1408_CR30","doi-asserted-by":"crossref","first-page":"1929","DOI":"10.1109\/TSP.2016.2637317","volume":"65","author":"G Scutari","year":"2017","unstructured":"Scutari, G., Facchinei, F., Lampariello, L.: Parallel and distributed methods for constrained nonconvex optimization-part i: theory. IEEE Trans. Signal Process. 65(8), 1929\u20131944 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"1408_CR31","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TSP.2016.2637314","volume":"65","author":"G Scutari","year":"2017","unstructured":"Scutari, G., Facchinei, F., Lampariello, L., Sardellitti, S., Song, P.: Parallel and distributed methods for constrained nonconvex optimization-part ii: applications in communications and machine learning. IEEE Trans. Signal Process. 65(8), 1945\u20131960 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1408_CR32","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/TSP.2013.2293126","volume":"62","author":"G Scutari","year":"2014","unstructured":"Scutari, G., Facchinei, F., Song, P., Palomar, D.P., Pang, J.-S.: Decomposition by partial linearization: parallel optimization of multi-agent systems. IEEE Trans. Signal Process. 62(3), 641\u2013656 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1408_CR33","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"issue":"4","key":"1408_CR34","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/0801036","volume":"1","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: On the rate of convergence of a partially asynchronous gradient projection algorithm. SIAM J. Optim. 1(4), 603\u2013619 (1991)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"1408_CR35","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","volume":"31","author":"John Tsitsiklis","year":"1986","unstructured":"Tsitsiklis, John, Bertsekas, Dimitri, Athans, Michael: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control 31(9), 803\u2013812 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1408_CR36","doi-asserted-by":"crossref","unstructured":"Wei, E., Ozdaglar, A.: On the o (1 = k) convergence of asynchronous distributed alternating direction method of multipliers. In: Global Conference on Signal and Information Processing (GlobalSIP), pp. 551\u2013554 (2013)","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"issue":"1","key":"1408_CR37","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"issue":"594","key":"1408_CR38","first-page":"225","volume":"87","author":"WH Young","year":"1912","unstructured":"Young, W.H.: On classes of summable functions and their Fourier series. Proc. R. Soc. Lond. Ser. A Math. Phys. Sci. 87(594), 225\u2013229 (1912)","journal-title":"Proc. R. Soc. Lond. Ser. A Math. Phys. Sci."},{"issue":"11","key":"1408_CR39","doi-asserted-by":"crossref","first-page":"975","DOI":"10.14778\/2732967.2732973","volume":"7","author":"H Yun","year":"2014","unstructured":"Yun, H., Yu, H.-F., Hsieh, C.-J., Vishwanathan, S.V.N., Dhillon, I.: Nomad: non-locking, stochastic multi-machine algorithm for asynchronous and decentralized matrix completion. Proc. VLDB Endowment 7(11), 975\u2013986 (2014)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01408-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01408-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01408-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T20:00:31Z","timestamp":1721419231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01408-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1408"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01408-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"5 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}