{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T04:22:12Z","timestamp":1786162932825,"version":"3.56.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10589-021-00286-3","type":"journal-article","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T07:14:27Z","timestamp":1623222867000},"page":"681-715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4206-9789","authenticated-orcid":false,"given":"Masoud","family":"Ahookhosh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Le Thi Khanh","family":"Hien","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Gillis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"issue":"3","key":"286_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00186-019-00674-w","volume":"89","author":"M Ahookhosh","year":"2019","unstructured":"Ahookhosh, M.: Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity. Math. Methods Oper. Res. 89(3), 319\u2013353 (2019)","journal-title":"Math. Methods Oper. Res."},{"key":"286_CR2","doi-asserted-by":"crossref","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. (2021)","DOI":"10.1007\/s10957-021-01880-5"},{"issue":"1","key":"286_CR3","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/19M1264783","volume":"31","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima. SIAM J. Optim. 31(1), 653\u2013685 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"286_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0169-7439(01)00119-8","volume":"57","author":"U Ara\u00fajo","year":"2001","unstructured":"Ara\u00fajo, U., Saldanha, B., Galv\u00e3o, R., Yoneyama, T., Chame, H., Visani, V.: The successive projections algorithm for variable selection in spectroscopic multicomponent analysis. Chemometr. Intell. Lab. Syst. 57(2), 65\u201373 (2001)","journal-title":"Chemometr. Intell. Lab. Syst."},{"issue":"1","key":"286_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16(1), 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"issue":"3","key":"286_CR6","first-page":"485","volume":"15","author":"H Attouch","year":"2008","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Alternating proximal algorithms for weakly coupled convex minimization problems. applications to dynamical games and PDE\u2019s. J. Convex Anal. 15(3), 485 (2008)","journal-title":"J. Convex Anal."},{"issue":"2","key":"286_CR7","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(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"286_CR8","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 Gauss-Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"286_CR9","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1137\/060657248","volume":"18","author":"H Attouch","year":"2007","unstructured":"Attouch, H., Redont, P., Soubeyran, A.: A new class of alternating proximal minimization algorithms with costs-to-move. SIAM J. Optim. 18(3), 1061\u20131081 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"286_CR10","first-page":"207","volume":"13","author":"H Attouch","year":"2006","unstructured":"Attouch, H., Soubeyran, A.: Inertia and reactivity in decision making as cognitive variational inequalities. J. Conv. Anal. 13(2), 207 (2006)","journal-title":"J. Conv. Anal."},{"key":"286_CR11","volume-title":"Optimisation m\u00e9thodes num\u00e9riques","author":"A Auslender","year":"1976","unstructured":"Auslender, A.: Optimisation m\u00e9thodes num\u00e9riques. Mason, Paris (1976)"},{"key":"286_CR12","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1007\/s10957-019-01516-9","volume":"182","author":"HH Bauschke","year":"2019","unstructured":"Bauschke, H.H., Bolte, J., Chen, J., Teboulle, M., Wang, X.: On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity. J. Optim. Theory Appl. 182, 1068\u20131087 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"286_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2016)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"286_CR14","doi-asserted-by":"publisher","first-page":"3208","DOI":"10.1137\/17M1130745","volume":"28","author":"HH Bauschke","year":"2018","unstructured":"Bauschke, H.H., Dao, M.N., Lindstrom, S.B.: Regularizing with Bregman\u2013Moreau envelopes. SIAM J. Optim. 28(4), 3208\u20133228 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"286_CR15","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1137\/15M1008397","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck, A., Pauwels, E., Sabach, S.: The cyclic block conditional gradient method for convex optimization problems. SIAM J. Optim. 25(4), 2024\u20132049 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"286_CR16","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1137\/15M1017557","volume":"37","author":"A Beck","year":"2016","unstructured":"Beck, A., Sabach, S., Teboulle, M.: An alternating semiproximal method for nonconvex regularized structured total least squares problems. SIAM J. Matrix Anal. Appl. 37(3), 1129\u20131150 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"286_CR17","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. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"286_CR18","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"286_CR19","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, Inc., Hoboken (1989)"},{"issue":"4","key":"286_CR20","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."},{"issue":"2","key":"286_CR21","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"286_CR22","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 \u0141ojasiewicz inequalities: subgradient flows, talweg, convexity. Trans. Am. Math. Soc. 362(6), 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"286_CR23","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(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"286_CR24","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28(3), 2131\u20132151 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"286_CR25","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/s10957-015-0730-z","volume":"171","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.R.: An inertial Tseng\u2019s type proximal algorithm for nonsmooth and nonconvex optimization problems. J. Optim. Theory Appl. 171(2), 600\u2013616 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"286_CR26","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."},{"issue":"3","key":"286_CR27","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"286_CR28","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"key":"286_CR29","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.I.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. John Wiley & Sons, Hoboken (2009)"},{"issue":"2","key":"286_CR30","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping. SIAM J. Optim. 25(2), 1221\u20131248 (2015)","journal-title":"SIAM J. Optim."},{"key":"286_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525919","volume-title":"Tame Topology and o-Minimal Structures","author":"L Van den Dries","year":"1998","unstructured":"Van den Dries, L.: Tame Topology and o-Minimal Structures, vol. 248. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"286_CR32","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/18M1168480","volume":"29","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Bianchi, P.: A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions. SIAM J. Optim. 29(1), 100\u2013134 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"286_CR33","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.K.: 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."},{"issue":"257","key":"286_CR34","first-page":"257","volume":"12","author":"N Gillis","year":"2014","unstructured":"Gillis, N.: The why and how of nonnegative matrix factorization. Regular. Optim. Kernels Support Vector Mach. 12(257), 257\u2013291 (2014)","journal-title":"Regular. Optim. Kernels Support Vector Mach."},{"issue":"4","key":"286_CR35","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TPAMI.2013.226","volume":"36","author":"N Gillis","year":"2013","unstructured":"Gillis, N., Vavasis, S.A.: Fast and robust recursive algorithmsfor separable nonnegative matrix factorization. IEEE Trans. Pattern Anal. Mach. Intell. 36(4), 698\u2013714 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"286_CR36","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. Operat. Res. Lett. 26(3), 127\u2013136 (2000)","journal-title":"Operat. Res. Lett."},{"key":"286_CR37","unstructured":"Hanzely, F., Richt\u00e1rik, P.: Fastest rates for stochastic mirror descent methods. arXiv:1803.07374 (2018)"},{"key":"286_CR38","first-page":"1","volume":"22","author":"F Hanzely","year":"2021","unstructured":"Hanzely, F., Richtarik, P., Xiao, L.: Accelerated bregman proximal gradient methods for relatively smooth convex optimization. Comput Optim Appl 22, 1\u201336 (2021)","journal-title":"Comput Optim Appl"},{"key":"286_CR39","unstructured":"Kimura, K., Tanaka, Y., Kudo, M.: A fast hierarchical alternating least squares algorithm for orthogonal nonnegative matrix factorization. In: D.\u00a0Phung, H.\u00a0Li (eds.) Proceedings of the Sixth Asian Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a039, pp. 129\u2013141. PMLR, Nha Trang City, Vietnam (2015). http:\/\/proceedings.mlr.press\/v39\/kimura14.html"},{"issue":"3","key":"286_CR40","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Annales de l\u2019institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019institut Fourier"},{"key":"286_CR41","doi-asserted-by":"crossref","unstructured":"Latafat, P., Freris, N.M., Patrinos, P.: A new randomized block-coordinate primal-dual proximal algorithm for distributed optimization. IEEE Trans. Autom. Cont. 64(10), 4050\u20134065 (2019)","DOI":"10.1109\/TAC.2019.2906924"},{"key":"286_CR42","doi-asserted-by":"crossref","unstructured":"Latafat, P., Themelis, A., Patrinos, P.: Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems. Math. Program. 1\u201330. arxiv.org\/abs\/1906.10053 (2021)","DOI":"10.1007\/s10107-020-01599-7"},{"key":"286_CR43","unstructured":"Li, Q., Zhu, Z., Tang, G., Wakin, M.B.: Provable Bregman-divergence based methods for nonconvex and non-Lipschitz problems. arXiv preprint arXiv:1904.09712 (2019)"},{"key":"286_CR44","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00e9quations aux d\u00e9riv\u00e9es partielles pp. 87\u201389 (1963)"},{"issue":"5","key":"286_CR45","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S \u0141ojasiewicz","year":"1993","unstructured":"\u0141ojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi- et sous- analytique. Annales de l\u2019institut Fourier 43(5), 1575\u20131595 (1993)","journal-title":"Annales de l\u2019institut Fourier"},{"issue":"1","key":"286_CR46","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R.M., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"286_CR47","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(3), 658\u2013682 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"2","key":"286_CR48","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"286_CR49","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"286_CR50","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.laa.2005.06.025","volume":"416","author":"VP Pauca","year":"2006","unstructured":"Pauca, V.P., Piper, J., Plemmons, R.J.: Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl. 416(1), 29\u201347 (2006)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"286_CR51","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2016","unstructured":"Pock, T., Sabach, S.: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J. Imag .Sci. 9(4), 1756\u20131787 (2016)","journal-title":"SIAM J. Imag .Sci."},{"key":"286_CR52","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.neucom.2014.02.018","volume":"141","author":"F Pompili","year":"2014","unstructured":"Pompili, F., Gillis, N., Absil, P.A., Glineur, F.: Two algorithms for orthogonal nonnegative matrix factorization with application to clustering. Neurocomputing 141, 15\u201325 (2014)","journal-title":"Neurocomputing"},{"issue":"2","key":"286_CR53","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"286_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1\u20132), 1\u201338 (2014)","journal-title":"Math. Program."},{"key":"286_CR55","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2011","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer Science & Business Media, Berlin (2011)"},{"key":"286_CR56","unstructured":"Choi, S.: Algorithms for orthogonal nonnegative matrix factorization. In: 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), pp. 1828\u20131832 (2008)"},{"issue":"1","key":"286_CR57","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s13675-015-0048-5","volume":"4","author":"R Shefi","year":"2016","unstructured":"Shefi, R., Teboulle, M.: On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems. EURO J. Comput. Optim. 4(1), 27\u201346 (2016)","journal-title":"EURO J. Comput. Optim."},{"issue":"2","key":"286_CR58","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/j.jmaa.2016.10.040","volume":"447","author":"MK Tam","year":"2017","unstructured":"Tam, M.K.: Regularity properties of non-negative sparsity sets. J. Math. Anal. Appl. 447(2), 758\u2013777 (2017)","journal-title":"J. Math. Anal. Appl."},{"key":"286_CR59","doi-asserted-by":"crossref","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 170(1), 67\u201396 (2018)","DOI":"10.1007\/s10107-018-1284-2"},{"key":"286_CR60","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-030-25939-6_15","volume-title":"Splitting Algorithms, Modern Operator Theory, and Applications","author":"A Themelis","year":"2019","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact Newton method. In: Luke, R., Bauschke, H., Burachik, R. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer, Berlin (2019)"},{"issue":"3","key":"286_CR61","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."},{"issue":"1\u20132","key":"286_CR62","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1\u20132), 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"286_CR63","unstructured":"Wang, X., Yuan, X., Zeng, S., Zhang, J., Zhou, J.: Block coordinate proximal gradient method for nonconvex optimization problems: convergence analysis. http:\/\/www.optimization-online.org\/DB\\_HTML\/2018\/04\/6573.html (2018)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00286-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00286-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00286-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T19:14:55Z","timestamp":1675451695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00286-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":63,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00286-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"16 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}