{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:15:22Z","timestamp":1756635322356,"version":"3.37.3"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-StG-676943"],"award-info":[{"award-number":["ERC-StG-676943"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11590-023-01976-z","type":"journal-article","created":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T03:03:11Z","timestamp":1679454191000},"page":"135-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local linear convergence of proximal coordinate descent algorithm"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5771-6013","authenticated-orcid":false,"given":"Quentin","family":"Klopfenstein","sequence":"first","affiliation":[]},{"given":"Quentin","family":"Bertrand","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Gramfort","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"Salmon","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Vaiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,22]]},"reference":[{"key":"1976_CR1","first-page":"1179","volume":"9","author":"F Bach","year":"2008","unstructured":"Bach, F.: Consistency of the group Lasso and multiple Kernel learning. J. Mach. Learn. Res. 9, 1179\u20131225 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1976_CR2","first-page":"651","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate type methods. SIAM J. Imaging Sci. 23(4), 651\u2013694 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"1976_CR3","unstructured":"Bertrand,Q. \u00a0Klopfenstein,Q. \u00a0Blondel,M. \u00a0Vaiter,S. \u00a0Gramfort,A. and \u00a0Salmon,J. Implicit differentiation of lasso-type models for hyperparameter optimization. In: International Conference on Machine Learning, 2020"},{"key":"1976_CR4","unstructured":"Bertrand,Q.\u00a0Klopfenstein, Q.\u00a0Massias, M.\u00a0Blondel, M.\u00a0Vaiter, S. \u00a0Gramfort,A. \u00a0Salmon,J. Implicit differentiation for fast hyperparameter selection in non-smooth convex learning. arXiv preprint arXiv:2105.01637, 2021"},{"issue":"2","key":"1976_CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"21","author":"DP Bertsekas","year":"1976","unstructured":"Bertsekas, D.P.: On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Autom. Control 21(2), 174\u2013184 (1976)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1976_CR6","unstructured":"Bertsekas,D.\u00a0P. Convex Optimization Theory, Chapter 1 Exercises and Solutions: Extended Version, Massachusetts Institute of Technology. URL http:\/\/www.athenasc.com\/convexdualitysol1.pdf, 2009"},{"key":"1976_CR7","doi-asserted-by":"crossref","unstructured":"Boser,B.\u00a0E. Guyon,I.\u00a0M. Vapnik,V.\u00a0N. A training algorithm for optimal margin classifiers. In: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pp. 144\u2013152. ACM, 1992","DOI":"10.1145\/130385.130401"},{"issue":"5","key":"1976_CR8","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"JV Burke","year":"1988","unstructured":"Burke, J.V., Mor\u00e9, J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25(5), 1197\u20131211 (1988)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"1976_CR9","first-page":"27","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: Libsvm: a library for support vector machines. ACM transactions on intelligent systems and technology (TIST) 2(3), 27 (2011)","journal-title":"ACM transactions on intelligent systems and technology (TIST)"},{"issue":"1","key":"1976_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1976_CR11","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"1976_CR12","unstructured":"Fadili,J. \u00a0Garrigos,G. \u00a0Malick,J.\u00a0Peyr\u00e9,G. Model consistency for learning with mirror-stratifiable regularizers. In: AISTATS, pp. 1236\u20131244. PMLR, 2019"},{"issue":"4","key":"1976_CR13","doi-asserted-by":"crossref","first-page":"2975","DOI":"10.1137\/17M113825X","volume":"28","author":"J Fadili","year":"2018","unstructured":"Fadili, J., Malick, J., Peyr\u00e9, G.: Sensitivity analysis for mirror-stratifiable convex functions. SIAM J. Optim. 28(4), 2975\u20133000 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1976_CR14","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., Richt\u00e1rik, P.: Accelerated, parallel and proximal coordinate descent. SIAM J. Optim. 25(3), 1997\u20132013 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1976_CR15","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman, J., Hastie, T.J., H\u00f6fling, H., Tibshirani, R.: Pathwise coordinate optimization. Ann. Appl. Stat. 1(2), 302\u2013332 (2007)","journal-title":"Ann. Appl. Stat."},{"issue":"1","key":"1976_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v033.i01","volume":"33","author":"J Friedman","year":"2010","unstructured":"Friedman, J., Hastie, T.J., Tibshirani, R.: Regularization paths for generalized linear models via coordinate descent. J. Stat. Softw. 33(1), 1\u201322 (2010)","journal-title":"J. Stat. Softw."},{"key":"1976_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-1-4419-9569-8_13","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"WL Hare","year":"2011","unstructured":"Hare, W.L.: Identifying active manifolds in regularization problems. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 261\u2013271. Springer, London (2011)"},{"issue":"2","key":"1976_CR18","first-page":"251","volume":"11","author":"WL Hare","year":"2004","unstructured":"Hare, W.L., Lewis, A.S.: Identifying active constraints via partial smoothness and prox-regularity. J. Convex Anal. 11(2), 251\u2013266 (2004)","journal-title":"J. Convex Anal."},{"issue":"2","key":"1976_CR19","first-page":"75","volume":"2","author":"WL Hare","year":"2007","unstructured":"Hare, W.L., Lewis, A.S.: Identifying active manifolds. Algorithmic Oper. Res. 2(2), 75\u201375 (2007)","journal-title":"Algorithmic Oper. Res."},{"issue":"1\u20132","key":"1976_CR20","doi-asserted-by":"crossref","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":"4","key":"1976_CR21","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s11228-020-00561-1","volume":"28","author":"F Iutzeler","year":"2020","unstructured":"Iutzeler, F., Malick, J.: Nonsmoothness in machine learning: Specific structure, proximal identification, and applications. Set-Valued Var. Anal. 28(4), 661\u2013678 (2020)","journal-title":"Set-Valued Var. Anal."},{"issue":"3","key":"1976_CR22","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: Convergence rates and conditioning. Math. Oper. Res. 35(3), 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1976_CR23","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S1052623401387623","volume":"13","author":"AS Lewis","year":"2002","unstructured":"Lewis, A.S.: Active sets, nonsmoothness, and sensitivity. SIAM J. Optim. 13(3), 702\u2013725 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1976_CR24","first-page":"6741","volume":"18","author":"X Li","year":"2017","unstructured":"Li, X., Zhao, T., Arora, R., Liu, H., Hong, M.: On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization. J. Mach. Learn. Res. 18(1), 6741\u20136764 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1976_CR25","first-page":"1970","volume":"27","author":"J Liang","year":"2014","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Local linear convergence of forward-backward under partial smoothness. Adv. Neural Inf. Process. Syst. 27, 1970\u20131978 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"1976_CR26","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/16M106340X","volume":"27","author":"J Liang","year":"2017","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Activity identification and local linear convergence of forward-backward-type methods. SIAM J. Optim. 27(1), 408\u2013437 (2017)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1976_CR27","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L Lions","year":"1979","unstructured":"Lions, P.-L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"1976_CR28","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"Z-Q Luo","year":"1992","unstructured":"Luo, Z.-Q., Tseng, P.: On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72(1), 7\u201335 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"1976_CR29","unstructured":"Massias, M., Gramfort, A., Salmon, J.: Celer: A fast solverthe lasso with dual extrapolation. In: ICML 80, pp. 3315\u20133324 (2018)"},{"key":"1976_CR30","first-page":"1","volume":"21","author":"M Massias","year":"2020","unstructured":"Massias, M., Vaiter, S., Gramfort, A., Salmon, J.: Dual extrapolation for sparse generalized linear models. J. Mach. Learn. Res. 21, 1\u201333 (2020)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"1976_CR31","doi-asserted-by":"crossref","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(1\u20132), 69\u2013107 (2019)","journal-title":"Math. Program."},{"issue":"2","key":"1976_CR32","doi-asserted-by":"crossref","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":"1976_CR33","doi-asserted-by":"crossref","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":"1976_CR34","unstructured":"Nutini, J. Greed is Good: Greedy Optimization Methods for Large-Scale Structured Problems. PhD thesis, University of British Columbia, 2018"},{"key":"1976_CR35","unstructured":"Nutini,J. Laradji,I. Schmidt, M. Let\u2019s Make Block Coordinate Descent Go Fast: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence. arXiv preprint arXiv:1712.08859, 2017"},{"issue":"4","key":"1976_CR36","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s11590-018-1325-z","volume":"13","author":"J Nutini","year":"2019","unstructured":"Nutini, J., Schmidt, M., Hare, W.: Active-set complexity of proximal gradient: How long does it take to find the sparsity pattern? Optim. Lett. 13(4), 645\u2013655 (2019)","journal-title":"Optim. Lett."},{"key":"1976_CR37","unstructured":"Nutini,J. Schmidt, M.\u00a0W. Laradji,I.\u00a0H. Friedlander, M.\u00a0P. Koepke,H.\u00a0A. Coordinate descent converges faster with the Gauss-Southwell rule than random selection. In: ICML, pp. 1632\u20131641, 2015"},{"key":"1976_CR38","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"1976_CR39","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1090\/S0002-9947-96-01544-9","volume":"348","author":"R Poliquin","year":"1996","unstructured":"Poliquin, R., Rockafellar, R.: Prox-regular functions in variational analysis. Trans. Am. Math. Soc. 348(5), 1805\u20131838 (1996)","journal-title":"Trans. Am. Math. Soc."},{"key":"1976_CR40","volume-title":"Introduction to Optimization. Optimization Software","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software. Inc., Publications Division, New York (1987)"},{"key":"1976_CR41","first-page":"7357","volume":"32","author":"C Poon","year":"2019","unstructured":"Poon, C., Liang, J.: Trajectory of alternating direction method of multipliers and adaptive acceleration. Adv. Neural Inf. Process. Syst. 32, 7357\u20137365 (2019)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1976_CR42","unstructured":"Poon, C., Liang, J., Sch\u00f6nlieb, C.-B.: Local convergence properties of SAGA\/Prox-SVRG and acceleration. In: International Conference on Machine Learning 90, pp. 4121\u20134129 (2018)"},{"issue":"5","key":"1976_CR43","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1080\/10556788.2016.1190360","volume":"31","author":"Z Qu","year":"2016","unstructured":"Qu, Z., Richt\u00e1rik, P.: Coordinate descent with arbitrary sampling i: Algorithms and complexity. Optim. Methods Softw. 31(5), 829\u2013857 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"5","key":"1976_CR44","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1080\/10556788.2016.1190361","volume":"31","author":"Z Qu","year":"2016","unstructured":"Qu, Z., Richt\u00e1rik, P.: Coordinate descent with arbitrary sampling ii: Expected separable overapproximation. Optim. Methods Softw. 31(5), 858\u2013884 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1976_CR45","doi-asserted-by":"crossref","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":"1976_CR46","doi-asserted-by":"crossref","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."},{"issue":"1","key":"1976_CR47","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1137\/110840054","volume":"23","author":"A Saha","year":"2013","unstructured":"Saha, A., Tewari, A.: On the nonasymptotic convergence of cyclic coordinate descent methods. SIAM J. Optim. 23(1), 576\u2013601 (2013)","journal-title":"SIAM J. Optim."},{"key":"1976_CR48","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for l1-regularized loss minimization. J. Mach. Learn. Res. 12, 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1976_CR49","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, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"1976_CR50","unstructured":"J.\u00a0She and M.\u00a0Schmidt. Linear convergence and support vector identification of sequential minimal optimization. In 10th NIPS Workshop on Optimization for Machine Learning, volume\u00a05, 2017"},{"key":"1976_CR51","unstructured":"H.-J.\u00a0M. Shi, S.\u00a0Tu, Y.\u00a0Xu, and W.\u00a0Yin. A primer on coordinate descent algorithms. ArXiv e-prints, 2016"},{"key":"1976_CR52","first-page":"1306","volume":"28","author":"R Sun","year":"2015","unstructured":"Sun, R., Hong, M.: Improved iteration complexity bounds of cyclic block coordinate descent for convex problems. Adv. Neural Inf. Process. Syst. 28, 1306\u20131314 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"1976_CR53","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/151004549","volume":"26","author":"S Tao","year":"2016","unstructured":"Tao, S., Boley, D., Zhang, S.: Local linear convergence of ISTA and FISTA on the LASSO problem. SIAM J. Optim. 26(1), 313\u2013336 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1976_CR54","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B Stat. Methodol. 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"issue":"3","key":"1976_CR55","doi-asserted-by":"crossref","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":"1976_CR56","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s10957-008-9458-3","volume":"140","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization. J. Optim. Theory Appl. 140(3), 513 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1976_CR57","first-page":"230","volume":"4","author":"S Vaiter","year":"2015","unstructured":"Vaiter, S., Golbabaee, M., Fadili, J., Peyr\u00e9, G.: Model selection with low complexity priors. Inf. Inference: A J. IMA 4(3), 230\u2013287 (2015)","journal-title":"Inf. Inference: A J. IMA"},{"issue":"3","key":"1976_CR58","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1109\/TIT.2017.2713822","volume":"64","author":"S Vaiter","year":"2018","unstructured":"Vaiter, S., Peyr\u00e9, G., Fadili, J.: Model consistency of partly smooth regularizers. IEEE Trans. Inf. Theory 64(3), 1725\u20131737 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1976_CR59","doi-asserted-by":"crossref","unstructured":"H.\u00a0Wang, H.\u00a0Zeng, and J.\u00a0Wang. Convergence rate analysis of proximal iteratively reweighted $$\\ell _1$$ methods for $$\\ell _p$$ regularization problems. Optim. Lett., pp. 1\u201323, 2022","DOI":"10.1007\/s11590-022-01907-4"},{"issue":"8","key":"1976_CR60","doi-asserted-by":"crossref","first-page":"2639","DOI":"10.1007\/s11590-020-01685-x","volume":"15","author":"H Wang","year":"2021","unstructured":"Wang, H., Zeng, H., Wang, J., Wu, Q.: Relating $$\\ell _p$$ regularization and reweighted $$\\ell _1$$ regularization. Optim. Lett. 15(8), 2639\u20132660 (2021)","journal-title":"Optim. Lett."},{"issue":"4","key":"1976_CR61","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0331048","volume":"31","author":"SJ Wright","year":"1993","unstructured":"Wright, S.J.: Identifiable surfaces in constrained optimization. SIAM J. Control. Optim. 31(4), 1063\u20131079 (1993)","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"1976_CR62","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"SJ Wright","year":"2012","unstructured":"Wright, S.J.: Accelerated block-coordinate relaxation for regularized optimization. SIAM J. Optim. 22(1), 159\u2013186 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1976_CR63","doi-asserted-by":"crossref","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":"1976_CR64","doi-asserted-by":"crossref","unstructured":"Zhang, T. Solving large scale linear prediction problems using stochastic gradient descent algorithms. In: Proceedings of the Twenty-First International Conference on Machine Learning, p. 116, (2004)","DOI":"10.1145\/1015330.1015332"},{"key":"1976_CR65","first-page":"2541","volume":"7","author":"P Zhao","year":"2006","unstructured":"Zhao, P., Yu, B.: On model selection consistency of lasso. J. Mach. Learn. Res. 7, 2541\u20132563 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"1976_CR66","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.J.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. Ser. B Stat Methodol. 67, 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01976-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01976-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01976-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T19:59:23Z","timestamp":1729108763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01976-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,22]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1976"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01976-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,3,22]]},"assertion":[{"value":"6 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}