{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T16:24:35Z","timestamp":1771863875868,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T00:00:00Z","timestamp":1707782400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T00:00:00Z","timestamp":1707782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["Grant Agreement No. 861137, TRADE-OPT"],"award-info":[{"award-number":["Grant Agreement No. 861137, TRADE-OPT"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["PN-III-P4-PCE-2021-0720, under project L2O-MOC, nr. 70\/2022"],"award-info":[{"award-number":["PN-III-P4-PCE-2021-0720, under project L2O-MOC, nr. 70\/2022"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10589-024-00556-w","type":"journal-article","created":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T09:03:27Z","timestamp":1707815007000},"page":"107-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coordinate descent methods beyond smoothness and separability"],"prefix":"10.1007","volume":"88","author":[{"given":"Flavia","family":"Chorobura","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1102-2654","authenticated-orcid":false,"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,13]]},"reference":[{"key":"556_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, New York (2004)"},{"key":"556_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"3","key":"556_CR3","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s10957-018-1328-z","volume":"178","author":"P Giselsson","year":"2018","unstructured":"Giselsson, P., F\u00e4lt, M.: Envelope functions: unifications and further properties. J. Optim. Theory Appl. 178(3), 673\u2013698 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"556_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward\u2013backward quasi-newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67(3), 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"556_CR5","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Stella, L., Bemporad, A.: Douglas\u2013Rachford splitting: complexity estimates and accelerated variants. In: Conference on Decision and Control (2014)","DOI":"10.1109\/CDC.2014.7040049"},{"key":"556_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"556_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17, 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"issue":"11","key":"556_CR8","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/TAC.2008.2007159","volume":"53","author":"I Necoara","year":"2008","unstructured":"Necoara, I., Suykens, J.A.K.: Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53(11), 2674\u20132679 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"key":"556_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10589-019-00137-2","volume":"75","author":"O Fercoq","year":"2020","unstructured":"Fercoq, O., Qu, Z.: Restarting the accelerated coordinate descent method with a rough strong convexity estimate. Comput. Optim. Appl. 75, 63\u201391 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"556_CR10","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., Richtarik, P.: Accelerated, parallel and proximal coordinate descent. SIAM J. Optim. 25(4), 1997\u20132023 (2015)","journal-title":"SIAM J. Optim."},{"key":"556_CR11","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/16M1060182","volume":"27","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Stich, S.U.: Efficiency of the accelerated coordinate descent method on structured optimization problems. SIAM J. Optim. 27, 110\u2013123 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"556_CR12","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":"556_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10957-021-01957-1","volume":"193","author":"A Aberdam","year":"2022","unstructured":"Aberdam, A., Beck, A.: An accelerated coordinate gradient descent algorithm for non-separable composite optimization. J. Optim. Theory Appl. 193, 219\u2013246 (2022)","journal-title":"J. Optim. Theory Appl."},{"key":"556_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-12119-8_4","volume-title":"Modeling and Optimization: Theory and Applications","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Richt\u00e1rik, P.: Smooth minimization of nonsmooth functions with parallel coordinate descent methods. In: Pint\u00e9r, J.D., Terlaky, T. (eds.) Modeling and Optimization: Theory and Applications, pp. 57\u201396. Springer, Cham (2019)"},{"issue":"1","key":"556_CR15","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."},{"key":"556_CR16","doi-asserted-by":"crossref","unstructured":"Gao, T., Lu, S., Liu, J., Chu, C.: On the convergence of randomized Bregman coordinate descent for non-Lipschitz composite problems. In: International Conference on Acoustics, Speech and Signal Processing, pp. 5549\u20135553 (2021)","DOI":"10.1109\/ICASSP39728.2021.9414191"},{"key":"556_CR17","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10589-021-00284-5","volume":"79","author":"F Hanzely","year":"2021","unstructured":"Hanzely, F., Richtarik, P.: Fastest rates for stochastic mirror descent methods. Comput. Optim. Appl. 79, 717\u2013766 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"556_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/21M1432661","volume":"4","author":"LTK Hien","year":"2022","unstructured":"Hien, L.T.K., 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."},{"key":"556_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019)","journal-title":"Math. Program."},{"key":"556_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165, 471\u2013507 (2017)","journal-title":"Math. Program."},{"key":"556_CR21","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013Lojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18, 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"key":"556_CR22","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10589-017-9900-2","volume":"67","author":"T Liu","year":"2017","unstructured":"Liu, T., Pong, T.K.: Further properties of the forward\u2013backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67, 489\u2013520 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"556_CR23","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1007\/s10208-021-09528-6","volume":"22","author":"P Yu","year":"2022","unstructured":"Yu, P., Li, G., Pong, T.K.: Kurdyka\u2013\u0141ojasiewicz exponent via inf-projection. Found. Comput. Math. 22, 1171\u20131217 (2022)","journal-title":"Found. Comput. Math."},{"key":"556_CR24","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandr, T.: Efficient projections onto the $$\\ell _1$$-ball for learning in high dimensions. In: Proceedings of the 25th International Conference on Machine Learning, pp. 272\u2013279 (2008)","DOI":"10.1145\/1390156.1390191"},{"key":"556_CR25","first-page":"1","volume":"19","author":"A Barbero","year":"2018","unstructured":"Barbero, A., Sra, S.: Modular proximal optimization for multidimensional total-variation regularization. J. Mach. Learn. Res. 19, 1\u201382 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"556_CR26","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1080\/10618600.2012.681238","volume":"22","author":"NA Johnson","year":"2013","unstructured":"Johnson, N.A.: A dynamic programming algorithm for the fused lasso and $$l_0$$-segmentation. J. Comput. Graph. Stat. 22(2), 246\u2013260 (2013)","journal-title":"J. Comput. Graph. Stat."},{"issue":"2","key":"556_CR27","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/15M1010257","volume":"9","author":"V Kolmogorov","year":"2016","unstructured":"Kolmogorov, V., Pock, T., Rolinek, M.: Total variation on a tree. SIAM J. Imaging Sci. 9(2), 605\u2013636 (2016)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"556_CR28","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":"3","key":"556_CR29","doi-asserted-by":"publisher","first-page":"2160","DOI":"10.1137\/22M148700X","volume":"33","author":"F Chorobura","year":"2023","unstructured":"Chorobura, F., Necoara, I.: Random coordinate descent methods for nonseparable composite optimization. SIAM J. Optim. 33(3), 2160\u20132190 (2023)","journal-title":"SIAM J. Optim."},{"key":"556_CR30","unstructured":"Maulen, R., Fadili, S.J., Attouch, H.: An SDE perspective on stochastic convex optimization. Preprint at arXiv:2207.02750 (2022)"},{"key":"556_CR31","doi-asserted-by":"publisher","DOI":"10.1515\/9781400835560","volume-title":"Real Analysis: Measure Theory, Integration, and Hilbert Spaces","author":"EM Stein","year":"2005","unstructured":"Stein, E.M., Shakarchi, R.: Real Analysis: Measure Theory, Integration, and Hilbert Spaces. Princeton University Press, Princeton (2005)"},{"key":"556_CR32","unstructured":"Necoara, I., Chorobura, F.: Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization. Preprint at arXiv:2104.13370 (2021)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00556-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00556-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00556-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T10:48:11Z","timestamp":1714128491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00556-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,13]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00556-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,13]]},"assertion":[{"value":"11 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 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"}}]}}