{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T03:38:51Z","timestamp":1777088331478,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2021YFA1000403"],"award-info":[{"award-number":["2021YFA1000403"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Nos. 12431012"],"award-info":[{"award-number":["Nos. 12431012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23B2012"],"award-info":[{"award-number":["U23B2012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10898-026-01613-w","type":"journal-article","created":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T03:39:20Z","timestamp":1776483560000},"page":"1005-1051","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic ADMM with variance-reduced recursive momentum and its accelerated variant for nonconvex nonsmooth optimization"],"prefix":"10.1007","volume":"94","author":[{"given":"Feiyu","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3445-4620","authenticated-orcid":false,"given":"Congying","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiande","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shichen","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,18]]},"reference":[{"key":"1613_CR1","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1007\/s11590-017-1195-9","volume":"12","author":"J Bai","year":"2018","unstructured":"Bai, J., Zhang, H., Li, J.: A parameterized proximal point algorithm for separable convex optimization. Optimization Letters 12, 1589\u20131608 (2018)","journal-title":"Optimization Letters"},{"issue":"3","key":"1613_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1109\/9.210141","volume":"38","author":"NP Papanikolopoulos","year":"1993","unstructured":"Papanikolopoulos, N.P., Khosla, P.K.: Adaptive robotic visual tracking: Theory and experiments. IEEE Trans. Autom. Control 38(3), 429\u2013445 (1993)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"12","key":"1613_CR3","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1093\/bioinformatics\/btp218","volume":"25","author":"S Kim","year":"2009","unstructured":"Kim, S., Sohn, K.-A., Xing, E.P.: A multivariate regression approach to association analysis of a quantitative trait network. Bioinformatics 25(12), 204\u2013212 (2009)","journal-title":"Bioinformatics"},{"issue":"1","key":"1613_CR4","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. Foundations and Trends\u00ae in Machine learning 3(1), 1\u2013122 (2011)","journal-title":"Foundations and Trends\u00ae in Machine learning"},{"issue":"2","key":"1613_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","volume":"81","author":"J Bai","year":"2022","unstructured":"Bai, J., Hager, W.W., Zhang, H.: An inexact accelerated stochastic admm for separable convex optimization. Comput. Optim. Appl. 81(2), 479\u2013518 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"1613_CR6","doi-asserted-by":"crossref","unstructured":"Bai, J., Zhang, M., Zhang, H.: An inexact admm for separable nonconvex and nonsmooth optimization. Computational Optimization and Applications, 1\u201335 (2025)","DOI":"10.1007\/s10589-024-00643-y"},{"key":"1613_CR7","doi-asserted-by":"crossref","unstructured":"Zeng, Y., Bai, J., Wang, S., Wang, Z.: A unified inexact stochastic admm for composite nonconvex and nonsmooth optimization. arXiv preprint arXiv:2403.02015 (2024)","DOI":"10.1016\/j.automatica.2024.111554"},{"key":"1613_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110551","volume":"146","author":"Y Yang","year":"2022","unstructured":"Yang, Y., Jia, Q.-S., Xu, Z., Guan, X., Spanos, C.J.: Proximal admm for nonconvex and nonsmooth optimization. Automatica 146, 110551 (2022)","journal-title":"Automatica"},{"issue":"4","key":"1613_CR9","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s10898-022-01174-8","volume":"84","author":"M Yashtini","year":"2022","unstructured":"Yashtini, M.: Convergence and rate analysis of a proximal linearized admm for nonconvex nonsmooth optimization. J. Global Optim. 84(4), 913\u2013939 (2022)","journal-title":"J. Global Optim."},{"key":"1613_CR10","doi-asserted-by":"crossref","unstructured":"Bai, J., Han, D., Sun, H., Zhang, H.: Convergence on a symmetric accelerated stochastic admm with larger stepsizes. arXiv preprint arXiv:2103.16154 (2021)","DOI":"10.4208\/csiam-am.SO-2021-0021"},{"key":"1613_CR11","doi-asserted-by":"crossref","unstructured":"Bai, J., Wang, B.: A proximal-perturbed bregman admm for solving nonsmooth and nonconvex optimization problems (2025)","DOI":"10.4208\/nmtma.OA-2025-0066"},{"key":"1613_CR12","unstructured":"Mai, V., Johansson, M.: Convergence of a stochastic gradient method with momentum for non-smooth non-convex optimization. In: International Conference on Machine Learning, pp. 6630\u20136639 (2020). PMLR"},{"key":"1613_CR13","doi-asserted-by":"publisher","first-page":"4486","DOI":"10.1109\/TSP.2021.3097211","volume":"69","author":"Z Wang","year":"2021","unstructured":"Wang, Z., Zhang, J., Chang, T.-H., Li, J., Luo, Z.-Q.: Distributed stochastic consensus optimization with momentum for nonconvex nonsmooth problems. IEEE Trans. Signal Process. 69, 4486\u20134501 (2021)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1613_CR14","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1137\/20M135474X","volume":"32","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Luo, Z.-Q.: A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization. SIAM J. Optim. 32(3), 2319\u20132346 (2022)","journal-title":"SIAM J. Optim."},{"key":"1613_CR15","unstructured":"Cai, X., Song, C., Wright, S., Diakonikolas, J.: Cyclic block coordinate descent with variance reduction for composite nonconvex optimization. In: International Conference on Machine Learning, pp. 3469\u20133494 (2023). PMLR"},{"key":"1613_CR16","unstructured":"Ouyang, H., He, N., Tran, L., Gray, A.: Stochastic alternating direction method of multipliers. In: International Conference on Machine Learning, pp. 80\u201388 (2013). PMLR"},{"key":"1613_CR17","unstructured":"Suzuki, T.: Stochastic dual coordinate ascent with alternating direction method of multipliers. In: International Conference on Machine Learning, pp. 736\u2013744 (2014). PMLR"},{"key":"1613_CR18","unstructured":"Zheng, S., Kwok, J.T.: Fast-and-light stochastic admm. In: IJCAI, pp. 2407\u20132613 (2016)"},{"issue":"12","key":"1613_CR19","doi-asserted-by":"publisher","first-page":"4242","DOI":"10.1109\/TPAMI.2020.3000512","volume":"43","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Shang, F., Liu, H., Kong, L., Jiao, L., Lin, Z.: Accelerated variance reduction stochastic admm for large-scale machine learning. IEEE Trans. Pattern Anal. Mach. Intell. 43(12), 4242\u20134255 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1613_CR20","unstructured":"Zhong, W., Kwok, J.: Fast stochastic alternating direction method of multipliers. In: International Conference on Machine Learning, pp. 46\u201354 (2014). PMLR"},{"key":"1613_CR21","unstructured":"Zhao, S.-Y., Li, W.-J., Zhou, Z.-H.: Scalable stochastic alternating direction method of multipliers. arXiv preprint arXiv:1502.03529 (2015)"},{"key":"1613_CR22","unstructured":"Huang, F., Chen, S., Lu, Z.: Stochastic alternating direction method of multipliers with variance reduction for nonconvex optimization. arXiv preprint arXiv:1610.02758 (2016)"},{"issue":"7","key":"1613_CR23","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ac0966","volume":"37","author":"F Bian","year":"2021","unstructured":"Bian, F., Liang, J., Zhang, X.: A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization. Inverse Prob. 37(7), 075009 (2021)","journal-title":"Inverse Prob."},{"key":"1613_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2024.111554","volume":"163","author":"Y Zeng","year":"2024","unstructured":"Zeng, Y., Wang, Z., Bai, J., Shen, X.: An accelerated stochastic admm for nonconvex and nonsmooth finite-sum optimization. Automatica 163, 111554 (2024)","journal-title":"Automatica"},{"key":"1613_CR25","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: Sarah: A novel method for machine learning problems using stochastic recursive gradient. In: International Conference on Machine Learning, pp. 2613\u20132621 (2017). PMLR"},{"key":"1613_CR26","doi-asserted-by":"crossref","unstructured":"Huang, F., Chen, S., Huang, H.: Faster stochastic alternating direction method of multipliers for nonconvex optimization. In: International Conference on Machine Learning, pp. 2839\u20132848 (2019). PMLR","DOI":"10.24963\/ijcai.2019\/354"},{"issue":"2","key":"1613_CR27","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s10107-020-01583-1","volume":"191","author":"Q Tran-Dinh","year":"2022","unstructured":"Tran-Dinh, Q., Pham, N.H., Phan, D.T., Nguyen, L.M.: A hybrid stochastic optimization framework for composite nonconvex optimization. Math. Program. 191(2), 1005\u20131071 (2022)","journal-title":"Math. Program."},{"key":"1613_CR28","unstructured":"Kovalev, D., Horv\u00e1th, S., Richt\u00e1rik, P.: Don\u2019t jump through hoops and remove those loops: Svrg and katyusha are better without the outer loop. In: Algorithmic Learning Theory, pp. 451\u2013467 (2020). PMLR"},{"key":"1613_CR29","unstructured":"Li, B., Ma, M., Giannakis, G.B.: On the convergence of sarah and beyond. In: International Conference on Artificial Intelligence and Statistics, pp. 223\u2013233 (2020). PMLR"},{"key":"1613_CR30","unstructured":"Cutkosky, A., Orabona, F.: Momentum-based variance reduction in non-convex sgd. Advances in neural information processing systems 32 (2019)"},{"issue":"1","key":"1613_CR31","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s10957-022-02132-w","volume":"196","author":"Y Xu","year":"2023","unstructured":"Xu, Y., Xu, Y.: Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization. J. Optim. Theory Appl. 196(1), 266\u2013297 (2023)","journal-title":"J. Optim. Theory Appl."},{"key":"1613_CR32","doi-asserted-by":"crossref","unstructured":"Liao, S., Liu, Y., Han, C., Guo, T.: Momentum-based variance-reduced stochastic bregman proximal gradient methods for nonconvex nonsmooth optimization. Expert Systems with Applications, 125960 (2024)","DOI":"10.1016\/j.eswa.2024.125960"},{"key":"1613_CR33","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of admm in nonconvex nonsmooth optimization. J. Sci. Comput. 78, 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"1613_CR34","doi-asserted-by":"publisher","first-page":"1932","DOI":"10.1137\/20M1387213","volume":"14","author":"D Driggs","year":"2021","unstructured":"Driggs, D., Tang, J., Liang, J., Davies, M., Schonlieb, C.-B.: A stochastic proximal alternating minimization for nonsmooth and nonconvex optimization. SIAM J. Imag. Sci. 14(4), 1932\u20131970 (2021)","journal-title":"SIAM J. Imag. Sci."},{"issue":"2","key":"1613_CR35","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/moor.2019.1008","volume":"45","author":"RI Bo\u0163","year":"2020","unstructured":"Bo\u0163, R.I., Nguyen, D.-K.: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates. Math. Oper. Res. 45(2), 682\u2013712 (2020)","journal-title":"Math. Oper. Res."},{"key":"1613_CR36","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Optimizing Methods in Statistics, pp. 233\u2013257. Elsevier, NY (1971)","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"key":"1613_CR37","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"221","key":"1613_CR38","first-page":"1","volume":"18","author":"Z Allen-Zhu","year":"2018","unstructured":"Allen-Zhu, Z.: Katyusha: The first direct acceleration of stochastic gradient methods. J. Mach. Learn. Res. 18(221), 1\u201351 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"456","key":"1613_CR39","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-026-01613-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-026-01613-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-026-01613-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T02:57:11Z","timestamp":1777085831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-026-01613-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1613"],"URL":"https:\/\/doi.org\/10.1007\/s10898-026-01613-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"26 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2026","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}