{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T10:32:21Z","timestamp":1780569141091,"version":"3.54.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2013,8,3]],"date-time":"2013-08-03T00:00:00Z","timestamp":1375488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Stat"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00180-013-0440-7","type":"journal-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T05:30:05Z","timestamp":1375421405000},"page":"623-639","source":"Crossref","is-referenced-by-count":13,"title":["Sparse trace norm regularization"],"prefix":"10.1007","volume":"29","author":[{"given":"Jianhui","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,3]]},"reference":[{"key":"440_CR1","first-page":"1019","volume":"9","author":"FR Bach","year":"2008","unstructured":"Bach FR (2008) Consistency of trace norm minimization. J Mach Learn Res 9:1019\u20131048","journal-title":"J Mach Learn Res"},{"issue":"1","key":"440_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imag Sci 2(1):183\u2013202","journal-title":"SIAM J Imag Sci"},{"issue":"4","key":"440_CR3","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1214\/08-AOS620","volume":"37","author":"PJ Bickel","year":"2009","unstructured":"Bickel PJ, Ritov Y, Tsybakov AB (2009) Simultaneous analysis of Lasso and dantzig selector. Ann Stat 37(4):1705\u20131732","journal-title":"Ann Stat"},{"key":"440_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"440_CR5","doi-asserted-by":"crossref","unstructured":"Bunea F, Tsybakov AB, Wegkamp MH (2006) Aggregation and sparsity via $$\\ell _1$$ \u2113 1 penalized least squares. In: Proceedings of the 19th annual conference on learning theory, pp 379\u2013391","DOI":"10.1007\/11776420_29"},{"issue":"12","key":"440_CR6","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215","journal-title":"IEEE Trans Inf Theory"},{"key":"440_CR7","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s EJ, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9: 717\u2013772","DOI":"10.1007\/s10208-009-9045-5"},{"issue":"1","key":"440_CR8","first-page":"1","volume":"58","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s EJ, Li X, Ma Y, Wright J (2009) Robust principal component analysis? J ACM 58(1):1\u201337","journal-title":"J ACM"},{"issue":"2","key":"440_CR9","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran V, Sanghavi S, Parrilo PA, Willsky AS (2011) Rank-sparsity incoherence for matrix decomposition. SIAM J Optim 21(2):572\u2013596","journal-title":"SIAM J Optim"},{"issue":"2","key":"440_CR10","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron B, Hastie T, Johnstone I, Tibshirani R (2004) Least angle regression. Ann Stat 32(2):407\u2013499","journal-title":"Ann Stat"},{"key":"440_CR11","doi-asserted-by":"crossref","unstructured":"Fazel M, Hindi H, Boyd SP (2001) A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of the American control conference, pp 4734\u20134739","DOI":"10.1109\/ACC.2001.945730"},{"issue":"2","key":"440_CR12","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman J, Hastie T, H\u00f6fling H, Tibshirani R (2007) Pathwise coordinate optimization. Ann Appl Stat 1(2):302\u2013332","journal-title":"Ann Appl Stat"},{"issue":"3","key":"440_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L Grippoa","year":"2000","unstructured":"Grippoa L, Sciandrone M (2000) On the convergence of the block nonlinear gauss-seidel method under convex constraints. Oper Res Lett 26(3):127\u2013136","journal-title":"Oper Res Lett"},{"key":"440_CR14","first-page":"3371","volume":"12","author":"J Huang","year":"2011","unstructured":"Huang J, Zhang T, Metaxas DN (2011) Learning with structured sparsity. J Mach Learn Res 12:3371\u20133412","journal-title":"J Mach Learn Res"},{"key":"440_CR15","first-page":"361","volume":"5","author":"DD Lewis","year":"2004","unstructured":"Lewis DD, Yang Y, Rose TG, Li F, Dietterich G, Li F (2004) RCV1: a new benchmark collection for text categorization research. J Mach Learn Res 5:361\u2013397","journal-title":"J Mach Learn Res"},{"key":"440_CR16","unstructured":"Lounici K, Pontil M, Tsybakov AB, van de Geer SA (2009) Taking advantage of sparsity in multi-task learning. In: The 22nd annual conference on learning theory"},{"key":"440_CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau JJ (1965) Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull de la Soci\u00e9t\u00e9 Math\u00e9matique de France 93:273\u2013299","journal-title":"Bull de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"issue":"2","key":"440_CR18","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1214\/10-AOS850","volume":"39","author":"S Negahban","year":"2011","unstructured":"Negahban S, Wainwright MJ (2011) Estimation of (near) low-rank matrices with noise and high-dimensional scaling. Ann Stat 39(2):1069\u20131097","journal-title":"Ann Stat"},{"key":"440_CR19","doi-asserted-by":"crossref","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 (2004) Introductory lectures on convex optimization: a basic course. Springer, Berlin"},{"issue":"1","key":"440_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov Y (2013) Gradient methods for minimizing composite objective function. Math Program 140(1):125\u2013161","journal-title":"Math Program"},{"issue":"9","key":"440_CR21","doi-asserted-by":"crossref","first-page":"2438","DOI":"10.1364\/JOSAA.11.002438","volume":"11","author":"YC Pati","year":"1994","unstructured":"Pati YC, Kailath T (1994) Phase-shifting masks for microlithography: automated design and mask requirements. J Opt Soc Am A 11(9):2438\u20132452","journal-title":"J Opt Soc Am A"},{"issue":"3","key":"440_CR22","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht B, Fazel M, Parrilo PA (2010) Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization. SIAM Rev 52(3):471\u2013501","journal-title":"SIAM Rev"},{"key":"440_CR23","unstructured":"Rennie JDM, Srebro N (2005) Fast maximum margin matrix factorization for collaborative prediction. In: Proceedings of the 22nd international conference on, machine learning, pp 713\u2013719"},{"issue":"2","key":"440_CR24","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1214\/10-AOS860","volume":"39","author":"A Rohde","year":"2011","unstructured":"Rohde A, Tsybakov AB (2011) Estimation of high-dimensional low rank matrices. Ann Stat 39(2):887\u2013930","journal-title":"Ann Stat"},{"key":"440_CR25","unstructured":"Srebro N, Rennie JDM, Jaakola TS (2005) Maximum-margin matrix factorization. In: Advances in neural information processing systems, vol 17"},{"issue":"2","key":"440_CR26","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0885-064X(91)90002-F","volume":"7","author":"SJ Szarek","year":"1991","unstructured":"Szarek SJ (1991) Condition numbers of random matrices. J Complex 7(2):131\u2013149","journal-title":"J Complex"},{"key":"440_CR27","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 (1996) Regression shrinkage and selection via the lasso. J R Stat Soc Ser B 58:267\u2013288","journal-title":"J R Stat Soc Ser B"},{"key":"440_CR28","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh KC, Todd MJ, Tutuncu R (1999) SDPT3: a MATLAB software package for semidefinite programming. Optim Methods Soft 11:545\u2013581","journal-title":"Optim Methods Soft"},{"key":"440_CR29","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh KC, Yun S (2010) An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac J Optim 6:615\u2013640","journal-title":"Pac J Optim"},{"key":"440_CR30","doi-asserted-by":"crossref","unstructured":"Ueda N, Saito K (2002) Single-shot detection of multiple categories of text using parametric mixture models. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, pp 626\u2013631","DOI":"10.1145\/775047.775140"},{"key":"440_CR31","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0024-3795(92)90407-2","volume":"170","author":"GA Watson","year":"1992","unstructured":"Watson GA (1992) Characterization of the subdifferential of some matrix norms. Linear Algebra Appl 170:33\u201345","journal-title":"Linear Algebra Appl"},{"issue":"5A","key":"440_CR32","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1214\/08-AOS659","volume":"37","author":"T Zhang","year":"2009","unstructured":"Zhang T (2009) Some sharp performance bounds for least squares regression with $$l_1$$ l 1 regularization. Ann Stat 37(5A):2109\u20132144","journal-title":"Ann Stat"},{"key":"440_CR33","first-page":"2541","volume":"7","author":"P Zhao","year":"2006","unstructured":"Zhao P, Yu B (2006) On model selection consistency of Lasso. J Mach Learn Res 7:2541\u20132563","journal-title":"J Mach Learn Res"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-013-0440-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00180-013-0440-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-013-0440-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T22:50:02Z","timestamp":1715813402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00180-013-0440-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,3]]},"references-count":33,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["440"],"URL":"https:\/\/doi.org\/10.1007\/s00180-013-0440-7","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,3]]}}}