{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:40:36Z","timestamp":1786981236599,"version":"build-2736575974"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991024"],"award-info":[{"award-number":["11991024"]}],"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":["12431010"],"award-info":[{"award-number":["12431010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["cstc2019jcyj-zdxmX0016"],"award-info":[{"award-number":["cstc2019jcyj-zdxmX0016"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["cstc2018jcyj-yszxX0009"],"award-info":[{"award-number":["cstc2018jcyj-yszxX0009"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10898-024-01451-8","type":"journal-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T02:21:49Z","timestamp":1734315709000},"page":"381-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation"],"prefix":"10.1007","volume":"92","author":[{"given":"Jie","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5185-5709","authenticated-orcid":false,"given":"Xinmin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,16]]},"reference":[{"key":"1451_CR1","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s10589-021-00286-3","volume":"79","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Hien, L.T.K., Gillis, N., Patrinos, P.: Multi-block Bregman proximal alternating linearized minimization and its application to sparse orthogonal nonnegative matrix factorization. Comput. Optim. Appl. 79, 681\u2013715 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1451_CR2","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\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"1451_CR3","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\u2013Lojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1451_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1451_CR5","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. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1451_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics (2017)"},{"key":"1451_CR7","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceeding of International Conference on Machine Learning, ICML\u201998, pp. 82\u201390 (1998)"},{"issue":"4","key":"1451_CR8","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(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"1451_CR9","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 linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"5","key":"1451_CR10","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1451_CR11","doi-asserted-by":"publisher","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions of $$\\ell _2-\\ell _p$$ minimization. SIAM J. Sci. Comput. 32, 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1451_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained $$\\ell _2-\\ell _p$$ minimization. Math. Program. 143, 371\u2013383 (2014)","journal-title":"Math. Program."},{"key":"1451_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-013-9553-8","volume":"59","author":"X Chen","year":"2014","unstructured":"Chen, X., Zhou, W.: Convergence of the reweighted $$\\ell _1$$ minimization algorithm for $$\\ell _2-\\ell _p$$ minimization. Comput. Optim. Appl. 59, 47\u201361 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1451_CR14","unstructured":"Dacrema, M.F., Cremonesi, P., Jannach, D.: Are we really making much progress? A worrying analysis of recent neural recommendation approaches. In: Proceedings of the 13th ACM Conference on Recommender Systems, pp. 101\u2013109 (2019)"},{"key":"1451_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., Gunturk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure. Appl. Math. 63, 1\u201338 (2010)","journal-title":"Commun. Pure. Appl. Math."},{"issue":"1","key":"1451_CR16","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178(1), 503\u2013558 (2019)","journal-title":"Math. Program."},{"key":"1451_CR17","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: 33rd International Conference on Acoustics, Speech, and Signal Processing (ICASSP) (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"1451_CR18","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans. Signal Process. 57, 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1451_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"1451_CR20","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L Grippo","year":"2000","unstructured":"Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear gauss-seidel method under convex constraints. Oper. Res. Lett. 26(3), 127\u2013136 (2000)","journal-title":"Oper. Res. Lett."},{"key":"1451_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-016-1057-8","volume":"163","author":"M Hong","year":"2017","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.: Iteration complexity analysis of block coordinate descent methods. Math. Program. 163, 85\u2013114 (2017)","journal-title":"Math. Program."},{"key":"1451_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-015-0969-z","volume":"160","author":"X Hua","year":"2016","unstructured":"Hua, X., Yamashita, N.: Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization. Math. Program. 160, 1\u201332 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1451_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/21M1432661","volume":"4","author":"LT Khanh Hien","year":"2022","unstructured":"Khanh Hien, L.T., Phan, D.N., Gillis, N., Ahookhosh, M., Patrinos, P.: Block Bregman majorization minimization with extrapolation. SIAM J. Math. Data Sci. 4(1), 1\u201325 (2022)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"8","key":"1451_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"1451_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with $$O(1\/{\\epsilon })$$ iteration-complexity for cone programming. Math. Program. 126, 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"1451_CR26","unstructured":"Le, H., Gillis, N., Patrinos, P.: Inertial block proximal methods for non-convex non-smooth optimization. In International Conference on Machine Learning, pp. 5671\u20135681 (2020)"},{"key":"1451_CR27","doi-asserted-by":"crossref","unstructured":"Lu, C., Wei, Y., Lin, Z., Yan, S.: Proximal iteratively reweighted algorithm with multiple splitting for nonconvex sparsity optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence (2014)","DOI":"10.1609\/aaai.v28i1.8897"},{"key":"1451_CR28","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-013-0722-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative reweighted minimization methods for $$\\ell _p $$ regularized unconstrained nonlinear programming. Math. Program. 147, 277\u2013307 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1451_CR29","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128(1), 321\u2013353 (2011)","journal-title":"Math. Program."},{"key":"1451_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation II: Applications [M]","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation II: Applications [M]. Springer, Berlin (2006)"},{"key":"1451_CR31","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.J.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"issue":"18","key":"1451_CR32","first-page":"1","volume":"24","author":"LTK Hien","year":"2023","unstructured":"Hien, L.T.K., Phan, D.N., Gillis, N.: An inertial block majorization minimization framework for nonsmooth nonconvex optimization. J. Mach. Learn. Res. 24(18), 1\u201341 (2023)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1451_CR33","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1080\/02331934.2018.1543295","volume":"68","author":"D Reem","year":"2019","unstructured":"Reem, D., Reich, S., Pierro, A.D.: Re-examination of Bregman functions and new properties of their divergences. Optimization 68(1), 279\u2013348 (2019)","journal-title":"Optimization"},{"key":"1451_CR34","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, New York (2009)"},{"issue":"4","key":"1451_CR35","first-page":"5","volume":"3","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Introductory lectures on convex programming volume I: basic course. Lecture Notes 3(4), 5 (1998)","journal-title":"Lecture Notes"},{"issue":"4","key":"1451_CR36","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10898-017-0507-z","volume":"68","author":"T Sun","year":"2017","unstructured":"Sun, T., Jiang, H., Cheng, L.: Global convergence of proximal iteratively reweighted algorithm. J. Glob. Optim. 68(4), 815\u2013826 (2017)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1451_CR37","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125(2), 263\u2013295 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"1451_CR38","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"1451_CR39","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10898-019-00828-4","volume":"76","author":"K Tu","year":"2020","unstructured":"Tu, K., Zhang, H., Gao, H., Feng, J.: A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems. J. Glob. Optim. 76, 665\u2013693 (2020)","journal-title":"J. Glob. Optim."},{"issue":"8","key":"1451_CR40","doi-asserted-by":"publisher","first-page":"2639","DOI":"10.1007\/s11590-020-01685-x","volume":"15","author":"H Wang","year":"2021","unstructured":"Wang, H., Zeng, H., Wang, J.: Relating $$\\ell _p$$ regularization and reweighted $$\\ell _1$$ regularization. Optim. Lett. 15(8), 2639\u20132660 (2021)","journal-title":"Optim. Lett."},{"issue":"3","key":"1451_CR41","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s10589-022-00416-5","volume":"83","author":"H Wang","year":"2022","unstructured":"Wang, H., Zeng, H., Wang, J.: An extrapolated iteratively reweighted $$\\ell _1 $$ method with complexity analysis. Comput. Optim. Appl. 83(3), 967\u2013997 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"1451_CR42","unstructured":"Wang, H., Yang, X., Jiang, W.: An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $$\\ell _ {p}$$ Ball. arXiv preprint arXiv:2104.02912 (2021)"},{"issue":"3","key":"1451_CR43","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1451_CR44","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10915-017-0376-0","volume":"72","author":"Y Xu","year":"2017","unstructured":"Xu, Y., Yin, W.: A globally convergent algorithm for nonconvex optimization based on block coordinate update. J. Sci. Comput. 72(2), 700\u2013734 (2017)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1451_CR45","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10589-019-00081-1","volume":"73","author":"P Yu","year":"2019","unstructured":"Yu, P., Pong, T.K.: Iteratively reweighted $$\\ell _1$$ algorithms with extrapolation. Comput. Optim. Appl. 73(2), 353\u2013386 (2019)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01451-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01451-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01451-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:28:43Z","timestamp":1748831323000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01451-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,16]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1451"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01451-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,16]]},"assertion":[{"value":"11 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}