{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T10:51:38Z","timestamp":1750071098708},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T00:00:00Z","timestamp":1490400000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CNRS MASTODONS","award":["2016TABASCO"],"award-info":[{"award-number":["2016TABASCO"]}]},{"name":"CNRS Imag\u2019in","award":["2015OPTIMISME"],"award-info":[{"award-number":["2015OPTIMISME"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10107-017-1133-8","type":"journal-article","created":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T11:50:21Z","timestamp":1490442621000},"page":"99-127","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Consistent learning by composite proximal thresholding"],"prefix":"10.1007","volume":"167","author":[{"given":"Patrick L.","family":"Combettes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saverio","family":"Salzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Villa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,25]]},"reference":[{"key":"1133_CR1","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1111\/1467-9574.00211","volume":"56","author":"A Antoniadis","year":"2002","unstructured":"Antoniadis, A., Leporini, D., Pesquet, J.-C.: Wavelet thresholding for some classes of non-Gaussian noise. Stat. Neerl. 56, 434\u2013453 (2002)","journal-title":"Stat. Neerl."},{"key":"1133_CR2","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1137\/S1052623493259616","volume":"6","author":"H Attouch","year":"1996","unstructured":"Attouch, H.: Viscosity solutions of minimization problems. SIAM J. Optim. 6, 769\u2013805 (1996)","journal-title":"SIAM J. Optim."},{"key":"1133_CR3","doi-asserted-by":"crossref","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, 2nd edn. Springer, New York (2017)","edition":"2"},{"key":"1133_CR4","doi-asserted-by":"crossref","first-page":"015005","DOI":"10.1088\/0266-5611\/25\/1\/015005","volume":"25","author":"K Bredies","year":"2009","unstructured":"Bredies, K.: A forward\u2013backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space. Inverse Probl. 25, 015005 (2009)","journal-title":"Inverse Probl."},{"key":"1133_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20192-9","volume-title":"Statistics for High-Dimensional Data","author":"P B\u00fchlmann","year":"2011","unstructured":"B\u00fchlmann, P., van de Geer, S.: Statistics for High-Dimensional Data. Springer, Heidelberg (2011)"},{"key":"1133_CR6","first-page":"35","volume":"10","author":"D Butnariu","year":"2003","unstructured":"Butnariu, D., Iusem, A.N., Z\u0103linescu, C.: On uniform convexity, total convexity and convergence of the proximal point and outer Bregman projection algorithms in Banach spaces. J. Convex Anal. 10, 35\u201361 (2003)","journal-title":"J. Convex Anal."},{"key":"1133_CR7","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1088\/0266-5611\/23\/4\/008","volume":"23","author":"C Chaux","year":"2007","unstructured":"Chaux, C., Combettes, P.L., Pesquet, J.-C., Wajs, V.: A variational formulation for frame-based inverse problems. Inverse Probl. 23, 1495\u20131518 (2007)","journal-title":"Inverse Probl."},{"key":"1133_CR8","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/S036301299732626X","volume":"38","author":"PL Combettes","year":"2000","unstructured":"Combettes, P.L.: Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM J. Control Optim. 38, 538\u2013565 (2000)","journal-title":"SIAM J. Control Optim."},{"key":"1133_CR9","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1137\/060669498","volume":"18","author":"PL Combettes","year":"2007","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal thresholding algorithm for minimization over orthonormal bases. SIAM J. Optim. 18, 1351\u20131376 (2007)","journal-title":"SIAM J. Optim."},{"key":"1133_CR10","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/JSTSP.2007.910264","volume":"1","author":"PL Combettes","year":"2007","unstructured":"Combettes, P.L., Pesquet, J.-C.: A Douglas\u2013Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Signal Process. 1, 564\u2013574 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1133_CR11","unstructured":"Combettes, P. L., Salzo, S., Villa, S.: Regularized learning schemes in feature Banach spaces. Analysis and Applications, published online 2016-12-07"},{"key":"1133_CR12","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\u2013backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"1133_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-01-00923-5","volume":"39","author":"F Cucker","year":"2002","unstructured":"Cucker, F., Smale, S.: On the mathematical foundations of learning. Bull. Am. Math. Soc. 39, 1\u201349 (2002)","journal-title":"Bull. Am. Math. Soc."},{"key":"1133_CR14","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, 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"key":"1133_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-319-41589-5_4","volume-title":"Convergence Rate Analysis of Several Splitting Schemes. Splitting Methods in Communication Imaging, Science, and Engineering","author":"D Davis","year":"2016","unstructured":"Davis, D., Yin, Y.: Convergence Rate Analysis of Several Splitting Schemes. Splitting Methods in Communication Imaging, Science, and Engineering, pp. 115\u2013163. Springer, New York (2016)"},{"key":"1133_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.jco.2009.01.002","volume":"25","author":"C Mol De","year":"2009","unstructured":"De Mol, C., De Vito, E., Rosasco, L.: Elastic-net regularization in learning theory. J. Complex. 25, 201\u2013230 (2009)","journal-title":"J. Complex."},{"key":"1133_CR17","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1089\/cmb.2008.0171","volume":"16","author":"C Mol De","year":"2009","unstructured":"De Mol, C., Mosci, S., Traskine, M., Verri, A.: A regularized method for selecting nested groups of relevant genes from microarray data. J. Comput. Biol. 16, 677\u2013690 (2009)","journal-title":"J. Comput. Biol."},{"key":"1133_CR18","first-page":"1363","volume":"5","author":"E Vito De","year":"2004","unstructured":"De Vito, E., Rosasco, L., Caponnetto, A., Piana, M., Verri, A.: Some properties of regularized kernel methods. J. Mach. Learn. Res. 5, 1363\u20131390 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"1133_CR19","first-page":"883","volume":"6","author":"E Vito De","year":"2005","unstructured":"De Vito, E., Rosasco, L., Caponnetto, A., De Giovannini, U., Odone, F.: Learning from examples as an inverse problem. J. Mach. Learn. Res. 6, 883\u2013904 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"1133_CR20","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.jco.2011.01.003","volume":"27","author":"E Vito De","year":"2011","unstructured":"De Vito, E., Umanit\u00e0, V., Villa, S.: A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization. J. Complex. 27, 188\u2013200 (2011)","journal-title":"J. Complex."},{"key":"1133_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018946025316","volume":"13","author":"T Evgeniou","year":"2000","unstructured":"Evgeniou, T., Pontil, M., Poggio, T.: Regularization networks and support vector machines. Adv. Comput. Math. 13, 1\u201350 (2000)","journal-title":"Adv. Comput. Math."},{"key":"1133_CR22","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"WJ Fu","year":"1998","unstructured":"Fu, W.J.: Penalized regressions: the bridge versus the lasso. J. Comput. Gr. Stat. 7, 397\u2013416 (1998)","journal-title":"J. Comput. Gr. Stat."},{"key":"1133_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/b97848","volume-title":"A Distribution-Free Theory of Nonparametric Regression","author":"L Gy\u00f6rfi","year":"2002","unstructured":"Gy\u00f6rfi, L., Kohler, M., Krzy\u017cak, A., Walk, H.: A Distribution-Free Theory of Nonparametric Regression. Springer, New York (2002)"},{"key":"1133_CR24","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00401706.1970.10488634","volume":"12","author":"AE Hoerl","year":"1970","unstructured":"Hoerl, A.E., Kennard, R.W.: Ridge regression: biased estimation for nonorthogonal problems. Technometrics 12, 55\u201367 (1970)","journal-title":"Technometrics"},{"key":"1133_CR25","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1214\/07-AIHP146","volume":"45","author":"V Koltchinskii","year":"2009","unstructured":"Koltchinskii, V.: Sparsity in penalized empirical risk minimization. Annales de l\u2019Institut Henri Poincar\u00e9 Probabilit\u00e9s et Statistiques 45, 7\u201357 (2009)","journal-title":"Annales de l\u2019Institut Henri Poincar\u00e9 Probabilit\u00e9s et Statistiques"},{"key":"1133_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-31082-7","volume-title":"Convexity and Well-Posed Problems","author":"R Lucchetti","year":"2006","unstructured":"Lucchetti, R.: Convexity and Well-Posed Problems. Springer, New York (2006)"},{"key":"1133_CR27","first-page":"2897","volume":"A255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: Fonctions convexes duales et points proximaux dans un espace hilbertien. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris A255, 2897\u20132899 (1962)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris"},{"key":"1133_CR28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Yu Nesterov","year":"2013","unstructured":"Nesterov, Yu.: Gradient methods for minimizing composite functions. Math. Program. Ser. B 140, 125\u2013161 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"1133_CR29","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software Inc, New York (1987)"},{"key":"1133_CR30","doi-asserted-by":"crossref","first-page":"2855","DOI":"10.1162\/NECO_a_00672","volume":"26","author":"S Salzo","year":"2014","unstructured":"Salzo, S., Masecchia, S., Verri, A., Barla, A.: Alternating proximal regularized dictionary learning. Neural Comput. 26, 2855\u20132895 (2014)","journal-title":"Neural Comput."},{"key":"1133_CR31","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19, 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"key":"1133_CR32","first-page":"1458","volume":"24","author":"M Schmidt","year":"2011","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. Adv. Neural Inf. Process. Syst. 24, 1458\u20131466 (2011)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1133_CR33","first-page":"416","volume-title":"Computational Learning Theory. Lecture Notes in Computer Science","author":"B Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Herbrich, R., Smola, A.J.: A generalized representer theorem. In: Helmbold, D., Williamson, B. (eds.) Computational Learning Theory. Lecture Notes in Computer Science, vol. 2111, pp. 416\u2013426. Springer, Berlin (2001)"},{"key":"1133_CR34","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23, 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"key":"1133_CR35","unstructured":"Wajs, V.: D\u00e9compositions et Algorithmes Proximaux pour l\u2019Analyse et le Traitement It\u00e9ratif des Signaux, Th\u00e8se de doctorat. Universit\u00e9 Pierre et Marie Curie, Paris (2007)"},{"key":"1133_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0092599","volume-title":"Sums and Gaussian Vectors. Lecture Notes in Mathematics","author":"V Yurinsky","year":"1995","unstructured":"Yurinsky, V.: Sums and Gaussian Vectors. Lecture Notes in Mathematics, vol. 1617. Springer, Berlin (1995)"},{"key":"1133_CR37","doi-asserted-by":"crossref","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Z\u0103linescu","year":"2002","unstructured":"Z\u0103linescu, C.: Convex Analysis in General Vector Spaces. World Scientific, River Edge (2002)"},{"key":"1133_CR38","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"Z Zou","year":"2005","unstructured":"Zou, Z., Hastie, T.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. Ser. B 67, 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. Ser. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1133-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1133-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1133-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T07:08:12Z","timestamp":1719126492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1133-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,25]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1133"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1133-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,25]]}}}