{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T20:29:21Z","timestamp":1791836961517,"version":"4.3.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Scientific Research Project of Tianjin Municipal Education Commission","award":["2022ZD007"],"award-info":[{"award-number":["2022ZD007"]}]},{"name":"Scientific Research Project of Tianjin Municipal Education Commission","award":["2022ZD007"],"award-info":[{"award-number":["2022ZD007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11075-023-01693-9","type":"journal-article","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T04:27:48Z","timestamp":1699504068000},"page":"51-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems"],"prefix":"10.1007","volume":"97","author":[{"given":"Chenzheng","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiao-Li","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"issue":"2","key":"1693_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.4208\/nmtma.OA-2020-0063","volume":"14","author":"MT Chao","year":"2021","unstructured":"Chao, M.T., Han, D.R., Cai, X.J.: Convergence of the Peaceman-Rachford splitting method for a class of nonconvex programs. Numer. Math. Theory Methods Appl. 14(2), 438\u2013460 (2021)","journal-title":"Numer. Math. Theory Methods Appl."},{"issue":"2","key":"1693_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/MSP.2018.2877582","volume":"36","author":"X Fu","year":"2019","unstructured":"Fu, X., Huang, K., Sidiropoulos, N.D., Ma, W.: Nonnegative matrix factorization for signal and data analytics: identifiability, algorithms, and applications. IEEE Signal Process. Mag. 36(2), 59\u201380 (2019)","journal-title":"IEEE Signal Process. Mag."},{"key":"1693_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero, P., Tapper, U.: Positive matrix factorization: a nonnegative factor model with optimal utilization of error estimates of data values. Environmetrics 5, 111\u2013126 (1994)","journal-title":"Environmetrics"},{"key":"1693_CR4","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by nonnegative matrix factorization. Nat. 401, 788\u2013791 (1999)","journal-title":"Nat."},{"issue":"3","key":"1693_CR5","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1109\/TCBB.2017.2756628","volume":"17","author":"Y Ma","year":"2020","unstructured":"Ma, Y., Hu, X., He, T., Jiang, X.: Clustering and integrating of heterogeneous microbiome data by joint symmetric nonnegative matrix factorization with Laplacian regularization. IEEE\/ACM Trans. Comput. Biol. Bioinform. 17(3), 788\u2013795 (2020)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"1693_CR6","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2017","unstructured":"Pock, T., Sabach, S.: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J. Imaging Sci. 9, 1756\u20131787 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"1693_CR7","doi-asserted-by":"crossref","unstructured":"Aspremont, A., Ghaoui, L. E., Jordan, M. I., Lanckriet, G. R.: A direct formulation for sparse PCA using semidefinite programming. in Advances in Neural Information Processing Systems 41\u201348 (2005)","DOI":"10.2139\/ssrn.563524"},{"key":"1693_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Statist. 15, 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Statist."},{"key":"1693_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Guass-Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1693_CR10","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"4","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 4, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1693_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearised minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1693_CR12","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1693_CR13","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. Publ. Math. Program. Soc. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program. Publ. Math. Program. Soc."},{"key":"1693_CR14","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10898-019-00819-5","volume":"76","author":"X Gao","year":"2020","unstructured":"Gao, X., Cai, X.J., Han, D.R.: A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems. J. Glob. Optim. 76, 863\u2013887 (2020)","journal-title":"J. Glob. Optim."},{"key":"1693_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.apnum.2023.03.014","volume":"189","author":"QX Wang","year":"2023","unstructured":"Wang, Q.X., Han, D.R.: A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems. Appl. Numer. Math. 189, 66\u201387 (2023)","journal-title":"Appl. Numer. Math."},{"key":"1693_CR16","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/s10898-022-01176-6","volume":"84","author":"J Zhao","year":"2022","unstructured":"Zhao, J., Dong, Q.L., Michael, Th.R., Wang, F.H.: Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems. J. Glob. Optim. 84, 941\u2013966 (2022)","journal-title":"J. Glob. Optim."},{"key":"1693_CR17","doi-asserted-by":"crossref","unstructured":"Guo, C. Z., Zhao, J.: Two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems, (2023). arXiv:2306.07614v1","DOI":"10.1007\/s11075-023-01693-9"},{"key":"1693_CR18","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1007\/s12190-022-01799-8","volume":"69","author":"MT Chao","year":"2023","unstructured":"Chao, M.T., Nong, F.F., Zhao, M.Y.: An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems. J. Appl. Math. Comput. 69, 1559\u20131581 (2023)","journal-title":"J. Appl. Math. Comput."},{"key":"1693_CR19","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/19M1298007","volume":"2","author":"MC Mukkamala","year":"2020","unstructured":"Mukkamala, M.C., Ochs, P., Pock, T., Sabach, S.: Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization. SIAM J. Math. Data Sci. 2, 658\u2013682 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1693_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s10957-021-01880-5","volume":"190","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Hien, L.T.K., Gillis, N., Patrinos, P.: A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization. J. Optim. Theory Appl. 190, 234\u2013258 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"1693_CR21","doi-asserted-by":"crossref","unstructured":"Bottou, L.: In: Large-scale machine learning with stochastic gradient descent. In Proceedings of COMPSTAT\u20192010, 1, 177\u2013186 (2010)","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"3","key":"1693_CR22","doi-asserted-by":"publisher","first-page":"1686","DOI":"10.1137\/140983938","volume":"25","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Yin, W.: Block stochastic gradient iteration for convex and nonconvex optimization. SIAM J. Optim. 25(3), 1686\u20131716 (2015)","journal-title":"SIAM J. Optim."},{"key":"1693_CR23","doi-asserted-by":"publisher","first-page":"1932","DOI":"10.1137\/20M1387213","volume":"4","author":"D Driggs","year":"2021","unstructured":"Driggs, D., Tang, J.Q., Liang, J.W., Davies, M., Schonlieb, C.B.: SPRING: a stochastic proximal alternating minimization for nonsmooth and nonconvex optimization. SIAM J. Imaing Sci. 4, 1932\u20131970 (2021)","journal-title":"SIAM J. Imaing Sci."},{"key":"1693_CR24","doi-asserted-by":"publisher","unstructured":"Hertrich, J., Steidl, G.: Inertial stochastic PALM and applications in machine learning. Sampl. Theory Sign Process. Data Anal. 20, (2022). https:\/\/doi.org\/10.1007\/s43670-022-00021-x","DOI":"10.1007\/s43670-022-00021-x"},{"key":"1693_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162, 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"1693_CR26","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. in Advances in Neural Information Processing Systems 315\u2013323 (2013)"},{"key":"1693_CR27","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/JSTSP.2015.2505682","volume":"10","author":"J Konecny","year":"2016","unstructured":"Konecny, J., Liu, J., Richtarik, P., Takac, M.: Mini-batch semi-stochastic gradient descent in the proximal setting. IEEE J. Sel. Top. Sign Process. 10, 242\u2013255 (2016)","journal-title":"IEEE J. Sel. Top. Sign Process."},{"key":"1693_CR28","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. in Advances in Neural Information Processing Systems 1646\u20131654 (2014)"},{"key":"1693_CR29","unstructured":"Li, B., Ma, M., Giannakis, G. B.: On the convergence of SARAH and beyond. in International Conference on Artificial Intelligence and Statistics, PMLR 223\u2013233 (2020)"},{"key":"1693_CR30","unstructured":"Nguyen, L. M., Liu, J., Scheinberg, K., and Tak\u00e1\u0109, M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. in Proceedings of the 34th International Conference on Machine Learning, 2613\u20132621 (2017)"},{"key":"1693_CR31","volume-title":"Variational analysis, Grundlehren der Mathematischen Wissenschaften","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.: Variational analysis, Grundlehren der Mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998)"},{"key":"1693_CR32","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"1693_CR33","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"Bolte, J., Daniilidis, A., Ley, O., Mazet, L.: Characterizations of Lojasiewicz inequalities: subgradient flows, talweg, convexity. Trans. Amer. Math. Soc. 362, 3319\u20133363 (2010)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1693_CR34","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. Prentice hall, Englewood Cliffs, NJ (1989)"},{"key":"1693_CR35","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non-negative almost supermartingales and some applications. Optimizing Methods in Statistics, Academic Press, New York, 233\u2013257 (1971)","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"key":"1693_CR36","unstructured":"Damek, D.: The asynchronous PALM algorithm for nonsmooth nonconvex problems (2016). arXiv:1604.00526"},{"key":"1693_CR37","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2007","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. B 116, 5\u201316 (2007)","journal-title":"Math. Program. B"},{"key":"1693_CR38","doi-asserted-by":"crossref","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nat. 788\u2013791 (1999)","DOI":"10.1038\/44565"},{"issue":"5","key":"1693_CR39","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1109\/TPAMI.2019.2956046","volume":"43","author":"J Pan","year":"2021","unstructured":"Pan, J., Gillis, N.: Generalized separable nonnegative matrix factorization. IEEE Trans. Pattern Anal. Mach. Intell. 43(5), 1546\u20131561 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"1693_CR40","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TCI.2018.2811910","volume":"4","author":"F Rousset","year":"2018","unstructured":"Rousset, F., Peyrin, F., Ducros, N.: A semi nonnegative matrix factorization technique for pattern generalization in single-pixel imaging. IEEE Trans. Comput. Imaging 4(2), 284\u2013294 (2018)","journal-title":"IEEE Trans. Comput. Imaging"},{"key":"1693_CR41","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.neucom.2011.09.024","volume":"80","author":"R Peharz","year":"2012","unstructured":"Peharz, R., Pernkopf, F.: Sparse nonnegative matrix factorization with $$l_0$$-constraints. Neurocomput. 80, 38\u201346 (2012)","journal-title":"Neurocomput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01693-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01693-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01693-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:23:02Z","timestamp":1722936182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01693-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,9]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1693"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01693-9","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,9]]},"assertion":[{"value":"10 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}