{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T03:17:28Z","timestamp":1775186248352,"version":"3.50.1"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T00:00:00Z","timestamp":1675814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T00:00:00Z","timestamp":1675814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["NORIA"],"award-info":[{"award-number":["NORIA"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["PRAIRIE"],"award-info":[{"award-number":["PRAIRIE"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10107-022-01923-3","type":"journal-article","created":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T19:40:31Z","timestamp":1675885231000},"page":"897-952","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Smooth over-parameterized solvers for non-smooth structured optimization"],"prefix":"10.1007","volume":"201","author":[{"given":"Clarice","family":"Poon","sequence":"first","affiliation":[]},{"given":"Gabriel","family":"Peyr\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,8]]},"reference":[{"key":"1923_CR1","unstructured":"Alber, Y.I.: Metric and generalized projection operators in Banach spaces: properties and applications (1993). arXiv:funct-an\/9311001"},{"issue":"3","key":"1923_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., Pontil, M.: Convex multi-task feature learning. Mach. Learn. 73(3), 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"key":"1923_CR3","unstructured":"Azulay, S., Moroshko, E., Nacson, M.S., Woodworth, B., Srebro, N., Globerson, A., Soudry, D.: On the implicit bias of initialization shape: beyond infinitesimal mirror descent (2021). arXiv:2102.09769"},{"key":"1923_CR4","doi-asserted-by":"crossref","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties (2011). arXiv:1108.0775","DOI":"10.1561\/9781601985118"},{"issue":"1","key":"1923_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"1923_CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.acha.2021.07.003","volume":"55","author":"D Batenkov","year":"2021","unstructured":"Batenkov, D., Goldman, G.: Single-exponential bounds for the smallest singular value of Vandermonde matrices in the sub-Rayleigh regime. Appl. Comput. Harmon. Anal. 55, 426\u2013439 (2021)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"1923_CR7","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","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 (2017)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1923_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1923_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"1923_CR10","doi-asserted-by":"crossref","first-page":"2445","DOI":"10.1137\/18M1167152","volume":"29","author":"S Becker","year":"2019","unstructured":"Becker, S., Fadili, J., Ochs, P.: On quasi-Newton forward-backward splitting: proximal calculus and convergence. SIAM J. Optim. 29(4), 2445\u20132481 (2019)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1923_CR11","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1093\/biomet\/asr043","volume":"98","author":"A Belloni","year":"2011","unstructured":"Belloni, A., Chernozhukov, V., Wang, L.: Square-root lasso: pivotal recovery of sparse signals via conic programming. Biometrika 98(4), 791\u2013806 (2011)","journal-title":"Biometrika"},{"issue":"1","key":"1923_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00131148","volume":"19","author":"MJ Black","year":"1996","unstructured":"Black, M.J., Rangarajan, A.: On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. Int. J. Comput. Vis. 19(1), 57\u201391 (1996)","journal-title":"Int. J. Comput. Vis."},{"issue":"2","key":"1923_CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1027074","volume":"27","author":"C Blair","year":"1985","unstructured":"Blair, C.: Problem complexity and method efficiency in optimization (as nemirovsky and db yudin). SIAM Rev. 27(2), 264 (1985)","journal-title":"SIAM Rev."},{"key":"1923_CR14","volume-title":"Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E.: Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers. Now Publishers Inc, Delft (2011)"},{"issue":"1","key":"1923_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1051\/cocv\/2011205","volume":"19","author":"K Bredies","year":"2013","unstructured":"Bredies, K., Pikkarainen, H.K.: Inverse problems in spaces of measures. ESAIM Control Optim. Calc. Var. 19(1), 190\u2013218 (2013)","journal-title":"ESAIM Control Optim. Calc. Var."},{"issue":"3","key":"1923_CR16","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1007\/s10957-017-1112-5","volume":"173","author":"K Bredies","year":"2017","unstructured":"Bredies, K., Sun, H.: A proximal point analysis of the preconditioned alternating direction method of multipliers. J. Optim. Theory Appl. 173(3), 878\u2013907 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"1923_CR17","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1002\/cpa.21455","volume":"67","author":"EJ Cand\u00e8s","year":"2014","unstructured":"Cand\u00e8s, E.J., Fernandez-Granda, C.: Towards a mathematical theory of super-resolution. Commun. Pure Appl. Math. 67(6), 906\u2013956 (2014)","journal-title":"Commun. Pure Appl. Math."},{"issue":"3","key":"1923_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM: JACM 58(3), 1\u201337 (2011)","journal-title":"J. ACM: JACM"},{"issue":"2","key":"1923_CR19","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006). https:\/\/doi.org\/10.1109\/TIT.2005.862083","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1923_CR20","first-page":"89","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imaging Vis. 20(1), 89\u201397 (2004)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"1923_CR21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s002110050258","volume":"76","author":"A Chambolle","year":"1997","unstructured":"Chambolle, A., Lions, P.L.: Image recovery via total variation minimization and related problems. Numer. Math. 76(2), 167\u2013188 (1997)","journal-title":"Numer. Math."},{"issue":"1","key":"1923_CR22","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"1923_CR23","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3869\u20133872. IEEE (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"1923_CR24","volume-title":"Convergence of Reweighted l1 Minimization Algorithms and Unique Solution of Truncated lp Minimization","author":"X Chen","year":"2010","unstructured":"Chen, X., Zhou, W.: Convergence of Reweighted l1 Minimization Algorithms and Unique Solution of Truncated lp Minimization. Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon (2010)"},{"key":"1923_CR25","unstructured":"Chizat, L.: Convergence rates of gradient methods for convex optimization in the space of measures (2021). arXiv:2105.08368"},{"issue":"9","key":"1923_CR26","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1080\/02331934.2012.733883","volume":"63","author":"PL Combettes","year":"2014","unstructured":"Combettes, P.L., V\u0169, B.C.: Variable metric forward-backward splitting with applications to monotone inclusions in duality. Optimization 63(9), 1289\u20131318 (2014)","journal-title":"Optimization"},{"issue":"11","key":"1923_CR27","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"1923_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., G\u00fcnt\u00fcrk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63(1), 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math."},{"issue":"2","key":"1923_CR29","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82(2), 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"1923_CR30","doi-asserted-by":"crossref","first-page":"A163","DOI":"10.1137\/17M1147342","volume":"41","author":"D Driggs","year":"2019","unstructured":"Driggs, D., Becker, S., Aravkin, A.: Adapting regularized low-rank models for parallel architectures. SIAM J. Sci. Comput. 41(1), A163\u2013A189 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"1923_CR31","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/aa5e12","volume":"33","author":"V Duval","year":"2017","unstructured":"Duval, V., Peyr\u00e9, G.: Sparse regularization on thin grids I: the lasso. Inverse Probl. 33(5), 055008 (2017)","journal-title":"Inverse Probl."},{"issue":"1\u20133","key":"1923_CR32","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0024-3795(02)00327-0","volume":"353","author":"Y Fan","year":"2002","unstructured":"Fan, Y.: Schur complements and its applications to symmetric nonnegative and z-matrices. Linear Algebra Appl. 353(1\u20133), 289\u2013307 (2002)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1923_CR33","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., Tibshirani, R.: Regularization paths for generalized linear models via coordinate descent. J. Stat. Softw. 33(1), 1 (2010)","journal-title":"J. Stat. Softw."},{"issue":"3","key":"1923_CR34","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00115697","volume":"6","author":"D Geiger","year":"1991","unstructured":"Geiger, D., Yuille, A.: A common framework for image segmentation. Int. J. Comput. Vis. 6(3), 227\u2013243 (1991)","journal-title":"Int. J. Comput. Vis."},{"issue":"3","key":"1923_CR35","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/34.120331","volume":"14","author":"D Geman","year":"1992","unstructured":"Geman, D., Reynolds, G.: Constrained restoration and the recovery of discontinuities. IEEE Trans. Pattern Anal. Mach. Intell. 14(3), 367\u2013383 (1992)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1923_CR36","unstructured":"Ghai, U., Hazan, E., Singer, Y.: Exponentiated gradient meets gradient descent. In: Kontorovich, A., Neu, G. (eds.) Algorithmic Learning Theory, pp. 386\u2013407. PMLR, New York (2020)"},{"key":"1923_CR37","unstructured":"Ghaoui, L.E., Viallon, V., Rabbani, T.: Safe feature elimination for the lasso and sparse supervised learning problems (2010). arXiv:1009.4219"},{"key":"1923_CR38","doi-asserted-by":"crossref","DOI":"10.1201\/9781003158745","volume-title":"Introduction to High-Dimensional Statistics","author":"C Giraud","year":"2021","unstructured":"Giraud, C.: Introduction to High-Dimensional Statistics. Chapman and Hall\/CRC, Boca Raton (2021)"},{"issue":"2","key":"1923_CR39","doi-asserted-by":"crossref","first-page":"R1","DOI":"10.1088\/0266-5611\/19\/2\/201","volume":"19","author":"G Golub","year":"2003","unstructured":"Golub, G., Pereyra, V.: Separable nonlinear least squares: the variable projection method and its applications. Inverse Probl. 19(2), R1 (2003)","journal-title":"Inverse Probl."},{"issue":"2","key":"1923_CR40","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0710036","volume":"10","author":"GH Golub","year":"1973","unstructured":"Golub, G.H., Pereyra, V.: The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM J. Numer. Anal. 10(2), 413\u2013432 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"1923_CR41","unstructured":"Gunasekar, S., Lee, J., Soudry, D., Srebro, N.: Characterizing implicit bias in terms of optimization geometry. In: International Conference on Machine Learning, pp. 1832\u20131841. PMLR (2018)"},{"key":"1923_CR42","unstructured":"Gunasekar, S., Woodworth, B., Srebro, N.: Mirrorless mirror descent: A natural derivation of mirror descent. In: International Conference on Artificial Intelligence and Statistics, pp. 2305\u20132313. PMLR (2021)"},{"issue":"1","key":"1923_CR43","first-page":"3367","volume":"16","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Mazumder, R., Lee, J.D., Zadeh, R.: Matrix completion and low-rank svd via fast alternating least squares. J. Mach. Learn. Res. 16(1), 3367\u20133402 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"1923_CR44","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.csda.2017.06.007","volume":"115","author":"PD Hoff","year":"2017","unstructured":"Hoff, P.D.: Lasso, fractional norm and structured sparse estimation using a Hadamard product parametrization. Comput. Stat. Data Anal. 115, 186\u2013198 (2017)","journal-title":"Comput. Stat. Data Anal."},{"key":"1923_CR45","doi-asserted-by":"crossref","unstructured":"Hong, J.H., Zach, C., Fitzgibbon, A.: Revisiting the variable projection method for separable nonlinear least squares problems. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 5939\u20135947. IEEE (2017)","DOI":"10.1109\/CVPR.2017.629"},{"issue":"6","key":"1923_CR46","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1080\/02331934.2018.1426584","volume":"67","author":"J Liang","year":"2018","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Local linear convergence analysis of primal-dual splitting methods. Optimization 67(6), 821\u2013853 (2018)","journal-title":"Optimization"},{"issue":"6","key":"1923_CR47","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL 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":"1923_CR48","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1214\/aos\/1034276635","volume":"25","author":"E Mammen","year":"1997","unstructured":"Mammen, E., van de Geer, S.: Locally adaptive regression splines. Ann. Stat. 25(1), 387\u2013413 (1997)","journal-title":"Ann. Stat."},{"issue":"3","key":"1923_CR49","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1109\/TNET.2015.2417809","volume":"24","author":"M Mardani","year":"2015","unstructured":"Mardani, M., Giannakis, G.B.: Estimating traffic and anomaly maps via network tomography. IEEE\/ACM Trans. Netw. 24(3), 1533\u20131547 (2015)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"1923_CR50","unstructured":"Massias, M., Gramfort, A., Salmon, J.: Celer: a fast solver for the lasso with dual extrapolation. In: International Conference on Machine Learning, pp. 3315\u20133324. PMLR (2018)"},{"issue":"3","key":"1923_CR51","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10444-011-9245-9","volume":"38","author":"CA Micchelli","year":"2013","unstructured":"Micchelli, C.A., Morales, J.M., Pontil, M.: Regularizers for structured sparsity. Adv. Comput. Math. 38(3), 455\u2013489 (2013)","journal-title":"Adv. Comput. Math."},{"key":"1923_CR52","doi-asserted-by":"crossref","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Lecl\u00e8re, V., Salmon, J.: Efficient smoothed concomitant lasso estimation for high dimensional regression. In: Journal of Physics: Conference Series, vol. 904, p. 012006. IOP Publishing (2017)","DOI":"10.1088\/1742-6596\/904\/1\/012006"},{"issue":"1","key":"1923_CR53","first-page":"4671","volume":"18","author":"E Ndiaye","year":"2017","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: Gap safe screening rules for sparsity enforcing penalties. J. Mach. Learn. Res. 18(1), 4671\u20134703 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1923_CR54","unstructured":"Nemirovskij, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. John Wiley, New York (1983)"},{"key":"1923_CR55","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$o(1\/k^{2})$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"1","key":"1923_CR56","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/B:JMIV.0000011920.58935.9c","volume":"20","author":"M Nikolova","year":"2004","unstructured":"Nikolova, M.: A variational approach to remove outliers and impulse noise. J. Math. Imaging Vis. 20(1), 99\u2013120 (2004)","journal-title":"J. Math. Imaging Vis."},{"key":"1923_CR57","unstructured":"Obozinski, G., Jacob, L., Vert, J.P.: Group lasso with overlaps: the latent group lasso approach (2011). arXiv:1110.0413"},{"issue":"3","key":"1923_CR58","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"issue":"6","key":"1923_CR59","doi-asserted-by":"crossref","first-page":"3465","DOI":"10.1137\/090763184","volume":"20","author":"TK Pong","year":"2010","unstructured":"Pong, T.K., Tseng, P., Ji, S., Ye, J.: Trace norm regularization: reformulations, algorithms, and multi-task learning. SIAM J. Optim. 20(6), 3465\u20133489 (2010)","journal-title":"SIAM J. Optim."},{"key":"1923_CR60","unstructured":"Poon, C., Peyr\u00e9, G.: Smooth bilevel programming for sparse regularization. In: Proceedings of NeurIPS\u201921 (2021). arxiv:2106.01429"},{"issue":"3","key":"1923_CR61","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"1923_CR62","doi-asserted-by":"crossref","unstructured":"Rennie, J.D., Srebro, N.: Fast maximum margin matrix factorization for collaborative prediction. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 713\u2013719 (2005)","DOI":"10.1145\/1102351.1102441"},{"key":"1923_CR63","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"issue":"1\u20134","key":"1923_CR64","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60(1\u20134), 259\u2013268 (1992)","journal-title":"Phys. D"},{"issue":"3","key":"1923_CR65","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1137\/1022057","volume":"22","author":"A Ruhe","year":"1980","unstructured":"Ruhe, A., Wedin, P.\u00c5.: Algorithms for separable nonlinear least squares problems. SIAM Rev. 22(3), 318\u2013337 (1980)","journal-title":"SIAM Rev."},{"issue":"4","key":"1923_CR66","doi-asserted-by":"crossref","first-page":"2687","DOI":"10.1137\/19M1240460","volume":"30","author":"A Silveti-Falls","year":"2020","unstructured":"Silveti-Falls, A., Molinari, C., Fadili, J.: Generalized conditional gradient with augmented Lagrangian for composite minimization. SIAM J. Optim. 30(4), 2687\u20132725 (2020)","journal-title":"SIAM J. Optim."},{"key":"1923_CR67","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511730344","volume-title":"Sparse Image and Signal Processing: Wavelets, Curvelets, Morphological Diversity","author":"JL Starck","year":"2010","unstructured":"Starck, J.L., Murtagh, F., Fadili, J.M.: Sparse Image and Signal Processing: Wavelets, Curvelets, Morphological Diversity. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"1923_CR68","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 (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc.: Ser. B (Methodol.)"},{"issue":"2","key":"1923_CR69","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125(2), 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"1923_CR70","doi-asserted-by":"crossref","unstructured":"van de Geer, S, Stucky, B.: $$\\chi $$ 2-confidence sets in high-dimensional regression. In: Frigessi, A., B\u00fchlmann, P., Glad, I.K., Langaas, M., Richardson, S., Vannucci, M. (eds.) Statistical Analysis for High-Dimensional Data, pp. 279\u2013306. Springer, Berlin (2016)","DOI":"10.1007\/978-3-319-27099-9_13"},{"issue":"25","key":"1923_CR71","doi-asserted-by":"crossref","first-page":"1999","DOI":"10.1056\/NEJMoa021967","volume":"347","author":"MJ Van De Vijver","year":"2002","unstructured":"Van De Vijver, M.J., He, Y.D., Van\u2019t Veer, L.J., Dai, H., Hart, A.A., Voskuil, D.W., Schreiber, G.J., Peterse, J.L., Roberts, C., Marton, M.J., et al.: A gene-expression signature as a predictor of survival in breast cancer. N. Engl. J. Med. 347(25), 1999\u20132009 (2002)","journal-title":"N. Engl. J. Med."},{"key":"1923_CR72","unstructured":"Va\u0161kevi\u010dius, T., Kanade, V., Rebeschini, P.: Implicit regularization for optimal sparse recovery (2019). arXiv:1909.05122"},{"issue":"1","key":"1923_CR73","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0917016","volume":"17","author":"CR Vogel","year":"1996","unstructured":"Vogel, C.R., Oman, M.E.: Iterative methods for total variation denoising. SIAM J. Sci. Comput. 17(1), 227\u2013238 (1996)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1923_CR74","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"1923_CR75","doi-asserted-by":"crossref","unstructured":"Zach, C., Bourmaud, G.: Descending, lifting or smoothing: secrets of robust cost optimization. In: Proceedings of the European Conference on Computer Vision (ECCV), pp. 547\u2013562 (2018)","DOI":"10.1007\/978-3-030-01258-8_34"},{"key":"1923_CR76","unstructured":"Zhao, P., Yang, Y., He, Q.C.: Implicit regularization via hadamard product over-parametrization in high-dimensional linear regression (2019). arXiv:1903.09367"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01923-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01923-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01923-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T21:19:43Z","timestamp":1728854383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01923-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,8]]},"references-count":76,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1923"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01923-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,8]]},"assertion":[{"value":"5 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No financial or non-financial interests are directly or indirectly related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}