{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:08:41Z","timestamp":1781215721039,"version":"3.54.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["1196820N"],"award-info":[{"award-number":["1196820N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004497","name":"Onderzoeksraad, KU Leuven","doi-asserted-by":"publisher","award":["C14\/18\/068"],"award-info":[{"award-number":["C14\/18\/068"]}],"id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G0A0920N"],"award-info":[{"award-number":["G0A0920N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G086518N"],"award-info":[{"award-number":["G086518N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G086318N"],"award-info":[{"award-number":["G086318N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["EOS project no 30468160"],"award-info":[{"award-number":["EOS project no 30468160"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10107-020-01599-7","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T03:30:49Z","timestamp":1610595049000},"page":"195-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems"],"prefix":"10.1007","volume":"193","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7969-8565","authenticated-orcid":false,"given":"Puya","family":"Latafat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6044-0169","authenticated-orcid":false,"given":"Andreas","family":"Themelis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4824-7697","authenticated-orcid":false,"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"issue":"1\u20132","key":"1599_CR1","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(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"1599_CR2","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\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1599_CR3","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."},{"key":"1599_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. Springer, Berlin (2017)"},{"key":"1599_CR5","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, Philadelphia, PA (2017)"},{"issue":"4","key":"1599_CR6","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."},{"issue":"2","key":"1599_CR7","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(2), 163\u2013195 (2011)","journal-title":"Math. Program."},{"key":"1599_CR8","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Singapore (2016)"},{"key":"1599_CR9","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, vol. 23. Prentice-Hall, Upper Saddle River (1989)"},{"issue":"10","key":"1599_CR10","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1109\/TAC.2015.2512043","volume":"61","author":"P Bianchi","year":"2016","unstructured":"Bianchi, P., Hachem, W., Iutzeler, F.: A coordinate descent primal-dual algorithm and application to distributed asynchronous optimization. IEEE Trans. Autom. Control 61(10), 2947\u20132957 (2016)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"1599_CR11","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":"1599_CR12","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":"1\u20132","key":"1599_CR13","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":"1","key":"1599_CR14","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.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"3","key":"1599_CR15","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10898-016-0405-9","volume":"66","author":"E Chouzenoux","year":"2016","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: A block coordinate variable metric forward-backward algorithm. J. Glob. Optim. 66(3), 457\u2013485 (2016)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1599_CR16","doi-asserted-by":"publisher","first-page":"A1280","DOI":"10.1137\/16M1102653","volume":"39","author":"YT Chow","year":"2017","unstructured":"Chow, Y.T., Wu, T., Yin, W.: Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications. SIAM J. Sci. Comput. 39(4), A1280\u2013A1300 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"1599_CR17","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis. Soc. Ind. Appl. Math. (1990)","DOI":"10.1137\/1.9781611971309"},{"issue":"2","key":"1599_CR18","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":"1599_CR19","unstructured":"Davis, D.: Smart: The stochastic monotone aggregated root-finding algorithm. arXiv:1601.00698 (2016)"},{"key":"1599_CR20","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, pp. 1646\u20131654 (2014)"},{"key":"1599_CR21","unstructured":"Defazio, A., Domke, J.: Finito: A faster, permutable incremental gradient method for big data problems. In: International Conference on Machine Learning, pp. 1125\u20131133 (2014)"},{"key":"1599_CR22","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, Berlin (2003)"},{"issue":"1","key":"1599_CR23","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":"3","key":"1599_CR24","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka\u2013\u0141ojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165(3), 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"8","key":"1599_CR25","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12(8), 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"key":"1599_CR26","unstructured":"Hanzely, F., Mishchenko, K., Richt\u00e1rik, P.: SEGA: Variance reduction via gradient sketching. In: Advances in Neural Information Processing Systems, pp. 2082\u20132093 (2018)"},{"issue":"1\u20132","key":"1599_CR27","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.Q.: Iteration complexity analysis of block coordinate descent methods. Math. Program. 163(1\u20132), 85\u2013114 (2017)","journal-title":"Math. Program."},{"issue":"6","key":"1599_CR28","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/TNNLS.2012.2194793","volume":"23","author":"Y Hou","year":"2012","unstructured":"Hou, Y., Song, I., Min, H.K., Park, C.H.: Complexity-reduced scheme for feature extraction with linear discriminant analysis. IEEE Trans. Neural Netw. Learn. Syst. 23(6), 1003\u20131009 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1599_CR29","doi-asserted-by":"crossref","unstructured":"Iutzeler, F., Bianchi, P., Ciblat, P., Hachem, W.: Asynchronous distributed optimization using a randomized alternating direction method of multipliers. In: 52nd IEEE Conference on Decision and Control (CDC), pp. 3671\u20133676 (2013)","DOI":"10.1109\/CDC.2013.6760448"},{"issue":"3","key":"1599_CR30","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"},{"issue":"10","key":"1599_CR31","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1109\/TAC.2019.2906924","volume":"64","author":"P Latafat","year":"2019","unstructured":"Latafat, P., Freris, N.M., Patrinos, P.: A new randomized block-coordinate primal-dual proximal algorithm for distributed optimization. IEEE Trans. Autom. Control 64(10), 4050\u20134065 (2019)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1599_CR32","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-015-0963-5","volume":"159","author":"G Li","year":"2016","unstructured":"Li, G., Pong, T.K.: Douglas\u2013Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159(1), 371\u2013401 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1599_CR33","doi-asserted-by":"publisher","first-page":"2244","DOI":"10.1137\/141000270","volume":"25","author":"Q Lin","year":"2015","unstructured":"Lin, Q., Lu, Z., Xiao, L.: An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization. SIAM J. Optim. 25(4), 2244\u20132273 (2015)","journal-title":"SIAM J. Optim."},{"key":"1599_CR34","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":"1599_CR35","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":"2","key":"1599_CR36","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25(2), 829\u2013855 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1599_CR37","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/16M1101702","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., G\u00fcrb\u00fczbalaban, M., Ribeiro, A.: Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate. SIAM J. Optim. 28(2), 1420\u20131447 (2018)","journal-title":"SIAM J. Optim."},{"issue":"8","key":"1599_CR38","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TAC.2013.2250071","volume":"58","author":"I Necoara","year":"2013","unstructured":"Necoara, I.: Random coordinate descent algorithms for multi-agent convex optimization over networks. IEEE Trans. Autom. Control 58(8), 2001\u20132012 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"1599_CR39","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10589-013-9598-8","volume":"57","author":"I Necoara","year":"2014","unstructured":"Necoara, I., Patrascu, A.: A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints. Comput. Optim. Appl. 57(2), 307\u2013337 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1599_CR40","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."},{"key":"1599_CR41","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, Springer (2013)"},{"issue":"2","key":"1599_CR42","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"1599_CR43","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In: 52nd IEEE Conference on Decision and Control, pp. 2358\u20132363 (2013)","DOI":"10.1109\/CDC.2013.6760233"},{"issue":"5","key":"1599_CR44","doi-asserted-by":"publisher","first-page":"A2851","DOI":"10.1137\/15M1024950","volume":"38","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: ARock: an algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38(5), A2851\u2013A2879 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"12","key":"1599_CR45","first-page":"2453","volume":"16","author":"JC Pesquet","year":"2015","unstructured":"Pesquet, J.C., Repetti, A.: A class of randomized primal-dual algorithms for distributed optimization. J. Nonlinear Convex Anal. 16(12), 2453\u20132490 (2015)","journal-title":"J. Nonlinear Convex Anal."},{"key":"1599_CR46","unstructured":"Qian, X., Sailanbayev, A., Mishchenko, K., Richt\u00e1rik, P.: MISO is making a comeback with better proofs and rates. arXiv:1906.01474 (2019)"},{"key":"1599_CR47","doi-asserted-by":"crossref","unstructured":"Reddi, S.J., Hefny, A., Sra, S., Poczos, B., Smola, A.J.: Stochastic variance reduction for nonconvex optimization. In: International Conference on Machine Learning, pp. 314\u2013323 (2016)","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"1599_CR48","unstructured":"Reddi, S.J., Sra, S., Poczos, B., Smola, A.J.: Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization. In: Advances in Neural Information Processing Systems, pp. 1145\u20131153 (2016)"},{"issue":"1\u20132","key":"1599_CR49","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":"1599_CR50","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Herbert Robbins Selected Papers, pp. 111\u2013135. Springer (1985)","DOI":"10.1007\/978-1-4612-5110-1_10"},{"key":"1599_CR51","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2011","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer, Berlin (2011)"},{"issue":"1","key":"1599_CR52","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(1), 83\u2013112 (2017)","journal-title":"Math. Program."},{"issue":"Feb","key":"1599_CR53","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14(Feb), 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"1599_CR54","unstructured":"Themelis, A.: Proximal algorithms for structured nonconvex optimization. Ph.D. thesis, KU Leuven (2018)"},{"key":"1599_CR55","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: Bauschke, H.H., Burachik, R.S., Luke, D.R. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer, Cham (2019)"},{"issue":"3","key":"1599_CR56","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1599_CR57","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":"3","key":"1599_CR58","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02592017","volume":"38","author":"P Tseng","year":"1987","unstructured":"Tseng, P., Bertsekas, D.P.: Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Program. 38(3), 303\u2013321 (1987)","journal-title":"Math. Program."},{"issue":"3","key":"1599_CR59","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10957-008-9458-3","volume":"140","author":"P Tseng","year":"2008","unstructured":"Tseng, P., Yun, S.: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization. J. Optim. Theory Appl. 140(3), 513\u2013535 (2008)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1599_CR60","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), 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"1599_CR61","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10589-008-9215-4","volume":"47","author":"P Tseng","year":"2010","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. 47(2), 179\u2013206 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1599_CR62","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":"1599_CR63","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."},{"key":"1599_CR64","unstructured":"Yu, P., Li, G., Pong, T.K.: Deducing Kurdyka-\u0141ojasiewicz exponent via inf-projection. arXiv:1902.03635 (2019)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01599-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01599-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01599-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T01:08:12Z","timestamp":1674954492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01599-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,13]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1599"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01599-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,13]]},"assertion":[{"value":"26 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}