{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T22:04:03Z","timestamp":1753740243371,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T00:00:00Z","timestamp":1692403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T00:00:00Z","timestamp":1692403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSRF via the Program Management Unit for Human Resources & Institutional Development, Research and Innovation","award":["B05F650018"],"award-info":[{"award-number":["B05F650018"]}]},{"name":"the Development and Promotion of Science and Technology Talents Project"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s12190-023-01908-1","type":"journal-article","created":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T07:01:42Z","timestamp":1692428502000},"page":"3911-3936","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An asynchronous subgradient-proximal method for solving additive convex optimization problems"],"prefix":"10.1007","volume":"69","author":[{"given":"Tipsuda","family":"Arunrat","sequence":"first","affiliation":[]},{"given":"Sakrapee","family":"Namsak","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1640-8919","authenticated-orcid":false,"given":"Nimit","family":"Nimana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,19]]},"reference":[{"key":"1908_CR1","unstructured":"Aybat, N., Wang, Z., Iyengar, G.: An asynchronous distributed proximal gradient method for composite convex optimization. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 2454\u20132462. PMLR (2015)"},{"key":"1908_CR2","unstructured":"Aytekin, A.: Asynchronous first-order algorithms for large-scale optimization: analysis and Implementation. PhD thesis, KTH Royal Institute of Technology (2019)"},{"issue":"8","key":"1908_CR3","first-page":"1823","volume":"9","author":"PL Bartlett","year":"2008","unstructured":"Bartlett, P.L., Wegkamp, M.H.: Classification with a reject option using a hinge loss. J. Mach. Learn. Res. 9(8), 1823\u20131840 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"1908_CR4","series-title":"CMS Books in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics, 2nd edn. Springer, New York (2017)","edition":"2"},{"key":"1908_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Ordered Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Ordered Methods in Optimization. SIAM, Philadelphia (2017)"},{"key":"1908_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. 129, 163\u2013195 (2011)","journal-title":"Math. Program."},{"key":"1908_CR7","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"key":"1908_CR8","volume-title":"Convex Analysis and Optimization","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P., Nedi\u0107, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)"},{"key":"1908_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/040615961","volume":"18","author":"D Blatt","year":"2007","unstructured":"Blatt, D., Hero, A.O., Gauchman, H.: A convergent incremental gradient method with a constant step size. SIAM J. Optim. 18, 29\u201351 (2007)","journal-title":"SIAM J. Optim."},{"key":"1908_CR10","series-title":"Lecture Notes in Mathematics","volume-title":"Iterative Methods for Fixed Point Problems in Hilbert Spaces","author":"A Cegielski","year":"2012","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Berlin (2012)"},{"key":"1908_CR11","doi-asserted-by":"crossref","unstructured":"Ekkarntrong, N., Arunrat, T., Nimana, N.: Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints. J. Inequalities Appl. 197 (2021)","DOI":"10.1186\/s13660-021-02734-4"},{"key":"1908_CR12","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/15M1049695","volume":"27","author":"M Gurbuzbalaban","year":"2017","unstructured":"Gurbuzbalaban, M., Ozdaglar, A., Parrilo, P.A.: On the convergence rate of incremental aggregated gradient algorithms. SIAM J. Optim. 27, 1035\u20131048 (2017)","journal-title":"SIAM J. Optim."},{"key":"1908_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.3389\/frobt.2019.00077","volume":"6","author":"K Hishinuma","year":"2019","unstructured":"Hishinuma, K., Iiduka, H.: Incremental and parallel machine learning algorithms with automated learning rate adjustments. Front. Robot. AI 6, 77 (2019)","journal-title":"Front. Robot. AI"},{"issue":"1","key":"1908_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/120866877","volume":"23","author":"H Iiduka","year":"2013","unstructured":"Iiduka, H.: Fixed point optimization algorithms for distributed optimization in networked systems. SIAM J. Optim. 23(1), 1\u201326 (2013)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1908_CR15","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/TCNS.2018.2889011","volume":"6","author":"H Iiduka","year":"2019","unstructured":"Iiduka, H.: Distributed optimization for network resource allocation with nonsmooth utility functions. IEEE Trans. Control Netw. Syst. 6(4), 1354\u20131365 (2019)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"1908_CR16","doi-asserted-by":"publisher","first-page":"4494","DOI":"10.1109\/TSP.2019.2926022","volume":"67","author":"Z Li","year":"2019","unstructured":"Li, Z., Shi, W., Yan, M.: A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates. IEEE Trans. Signal Process. 67, 4494\u20134506 (2019)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1908_CR17","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1109\/TAC.2020.2989282","volume":"66","author":"X Li","year":"2021","unstructured":"Li, X., Feng, G., Xie, L.: Distributed proximal algorithms for multi-agent optimization with coupled inequality constraints. IEEE Trans. Autom. Control 66(3), 1223\u20131230 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1908_CR18","first-page":"163","volume":"274A","author":"B Martinet","year":"1972","unstructured":"Martinet, B.: Determination approchee d\u2019un point fixe d\u2019une application pseudocontractante. C. R. Acad. Sci. Paris 274A, 163\u2013165 (1972)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1908_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.rinam.2023.100370","volume":"18","author":"S Namsak","year":"2023","unstructured":"Namsak, S., Petrot, N., Nimana, N.: A distributed proximal gradient method with time-varying delays for solving additive convex optimizations. Results Appl. Math. 18, 100370 (2023)","journal-title":"Results Appl. Math."},{"key":"1908_CR20","doi-asserted-by":"publisher","unstructured":"Nedic, A., Olshevsky, A., Ozdaglar, A., Tsitsiklis, J.N.: Distributed subgradient methods and quantization effects. In: 2008 47th IEEE Conference on Decision and Control. https:\/\/doi.org\/10.1109\/cdc.2008.4738860","DOI":"10.1109\/cdc.2008.4738860"},{"issue":"1","key":"1908_CR21","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"51","author":"A Nedic","year":"2009","unstructured":"Nedic, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 51(1), 48\u201361 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"1908_CR22","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TAC.2010.2041686","volume":"55","author":"A Nedic","year":"2010","unstructured":"Nedic, A., Ozdaglar, A., Parril, P.A.: Constraint consensus and optimization in multi-agent networks. IEEE Trans. Autom. Control 55(4), 922\u2013938 (2010)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"1908_CR23","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1109\/TCNS.2021.3065653","volume":"8","author":"Y Niu","year":"2021","unstructured":"Niu, Y., Li, H., Wang, Z., Lu, Q., Xia, D., Ji, L.: A distributed stochastic proximal-gradient algorithm for composite optimization. IEEE Trans. Control Netw. Syst. 8(3), 1383\u20131393 (2021)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"1908_CR24","doi-asserted-by":"publisher","first-page":"2095","DOI":"10.1109\/TAC.2016.2607023","volume":"62","author":"I Notarnicola","year":"2017","unstructured":"Notarnicola, I., Notarstefano, G.: Asynchronous distributed optimization via a randomized dual proximal gradient. IEEE Trans. Autom. Control 62, 2095\u20132106 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5\u20136","key":"1908_CR25","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1080\/02331934.2020.1846188","volume":"70","author":"N Petrot","year":"2021","unstructured":"Petrot, N., Nimana, N.: Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems. Optimization 70(5\u20136), 1307\u20131336 (2021)","journal-title":"Optimization"},{"issue":"3","key":"1908_CR26","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","volume":"147","author":"SS Ram","year":"2010","unstructured":"Ram, S.S., Nedic, A., Veeravall, V.V.: Distributed stochastic subgradient projection algorithms for convex optimization. J. Optim. Theory Appl. 147(3), 516\u2013545 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"1908_CR27","doi-asserted-by":"crossref","unstructured":"Tsianos, K.I., Rabbat, M.G.: Distributed dual averaging for convex optimization under communication delays. In: Proc. Amer. Control Conf., pp. 1067\u20131072 (2012)","DOI":"10.1109\/ACC.2012.6315289"},{"key":"1908_CR28","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","volume":"31","author":"J Tsitsiklis","year":"1986","unstructured":"Tsitsiklis, J., Bertsekas, D., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control 31, 803\u2013812 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1908_CR29","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1137\/16M1094415","volume":"28","author":"ND Vanli","year":"2018","unstructured":"Vanli, N.D., Gurbuzbalaban, M., Ozdaglar, A.: Global convergence rate of proximal incremental aggregated gradient methods. SIAM J. Optim. 28, 1282\u20131300 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1908_CR30","first-page":"363","volume":"45","author":"H Wang","year":"2015","unstructured":"Wang, H., Liao, X., Huang, T., Li, C.: Cooperative distributed optimization in multiagent networks with delays. IEEE Trans. SMC 45(2), 363\u2013369 (2015)","journal-title":"IEEE Trans. SMC"},{"issue":"2","key":"1908_CR31","first-page":"293","volume":"4","author":"T Wu","year":"2018","unstructured":"Wu, T., Yuan, K., Ling, Q., Yin, W., Sayed, A.H.: Decentralized consensus optimization with asynchrony and delays. IEEE Trans. Signal Inf. Process. Netw. 4(2), 293\u2013307 (2018)","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"issue":"3","key":"1908_CR32","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10994-014-5436-1","volume":"98","author":"T Yang","year":"2015","unstructured":"Yang, T., Mahdavi, M., Jin, R., Zhu, S.: An efficient primal-dual prox method for non-smooth optimization. J. Mach. Learn. Res. 98(3), 369\u2013406 (2015)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01908-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01908-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01908-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T14:33:59Z","timestamp":1695825239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01908-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,19]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1908"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01908-1","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,8,19]]},"assertion":[{"value":"24 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2023","order":4,"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 that there is no conflict of interest regarding the publication of this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}