{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T14:43:17Z","timestamp":1769006597917,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,23]],"date-time":"2012-10-23T00:00:00Z","timestamp":1350950400000},"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":[[2013,8]]},"DOI":"10.1007\/s00180-012-0373-6","type":"journal-article","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:47:06Z","timestamp":1350895626000},"page":"1699-1714","source":"Crossref","is-referenced-by-count":8,"title":["A simple and efficient algorithm for fused lasso signal approximator with convex loss function"],"prefix":"10.1007","volume":"28","author":[{"given":"Lichun","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Lian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,23]]},"reference":[{"key":"373_CR1","volume-title":"Elementary numerical analysis : an algorithmic approach","author":"SD Conte","year":"1980","unstructured":"Conte SD, De Boor C (1980) Elementary numerical analysis : an algorithmic approach, 3rd edn. McGraw-Hill, New York","edition":"3"},{"key":"373_CR2","volume-title":"Infinite-dimensional optimization and convexity. Chicago lectures in mathematics","author":"I Ekeland","year":"1983","unstructured":"Ekeland I, Turnbull T (1983) Infinite-dimensional optimization and convexity. Chicago lectures in mathematics. University of Chicago Press, Chicago"},{"issue":"2","key":"373_CR3","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman J, Hastie T, Hofling H, Tibshirani R (2007) Pathwise coordinate optimization. Ann Appl Stat 1(2):302\u2013332","journal-title":"Ann Appl Stat"},{"key":"373_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970838","volume-title":"Augmented Lagrangian and operator-splitting methods in nonlinear mechanics","author":"R Glowinski","year":"1989","unstructured":"Glowinski R, Le Tallec P (1989) Augmented Lagrangian and operator-splitting methods in nonlinear mechanics. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"373_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes MR (1969) Multiplier and gradient methods. J Optim Theory Appl 4:303\u2013320","journal-title":"J Optim Theory Appl"},{"key":"373_CR6","doi-asserted-by":"crossref","unstructured":"Hoefling H (2010) A path algorithm for the fused lasso signal approximator. J Comput Graph Stat 19(4): 984\u20131006","DOI":"10.1198\/jcgs.2010.09208"},{"issue":"20","key":"373_CR7","doi-asserted-by":"crossref","first-page":"3811","DOI":"10.1093\/bioinformatics\/bti646","volume":"21","author":"T Huang","year":"2005","unstructured":"Huang T, Wu BL, Lizardi P, Zhao HY (2005) Detection of DNA copy number alterations using penalized least squares regression. Bioinformatics 21(20):3811\u20133817","journal-title":"Bioinformatics"},{"key":"373_CR8","unstructured":"Powell MJD (1969) A method for nonlinear constraints in minimization problems. In: Fletcher R (ed) Optimization. Academic Press, New York, pp 283\u2013298"},{"key":"373_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton"},{"issue":"3","key":"373_CR10","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1214\/009053606000001370","volume":"35","author":"S Rosset","year":"2007","unstructured":"Rosset S, Zhu J (2007) Piecewise linear regularized solution paths. Ann Stat 35(3):1012\u20131030","journal-title":"Ann Stat"},{"key":"373_CR11","unstructured":"Tai X-C, Wu C (2009) Augmented Lagrangian method, dual methods and split Bregman iteration for ROF model. In: 2nd international conference on scale space and variational methods in computer vision. pp 502\u2013513"},{"issue":"1","key":"373_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao M, Yuan X (2011) Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J Optim 21(1):57\u201381","journal-title":"SIAM J Optim"},{"key":"373_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani R, Saunders M, Rosset S, Zhu J, Knight K (2005) Sparsity and smoothness via the fused lasso. J R Stat Soc Ser B-Stat Methodology 67:91\u2013108","journal-title":"J R Stat Soc Ser B-Stat Methodology"},{"issue":"1","key":"373_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1093\/biostatistics\/kxm013","volume":"9","author":"R Tibshirani","year":"2008","unstructured":"Tibshirani R, Wang P (2008) Spatial smoothing and hot spot detection for CGH data using the fused lasso. Biostatistics 9(1):18\u201329","journal-title":"Biostatistics"},{"issue":"3","key":"373_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen Z, Goldfarb D, Yin W (2010) Alternating direction augmented Lagrangian methods for semidefinite programming. Math Program Comput 2(3):203\u2013230","journal-title":"Math Program Comput"},{"key":"373_CR16","doi-asserted-by":"crossref","unstructured":"Yang J, Yuan X (2012) Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math Comput 82:301\u2013329","DOI":"10.1090\/S0025-5718-2012-02598-1"},{"key":"373_CR17","doi-asserted-by":"crossref","unstructured":"Yang J, Zhang Y (2011) Alternating direction algorithms for $$l_{1}$$ -problems in compressive sensing. SIAM J Scientific Comput 33(1):250\u2013278","DOI":"10.1137\/090777761"},{"issue":"4","key":"373_CR18","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1214\/009053607000000802","volume":"36","author":"H Zou","year":"2008","unstructured":"Zou H, Li RZ (2008) One-step sparse estimates in nonconcave penalized likelihood models. Ann Stat 36(4):1509\u20131533","journal-title":"Ann Stat"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-012-0373-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00180-012-0373-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-012-0373-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:36:49Z","timestamp":1558636609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00180-012-0373-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,23]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s00180-012-0373-6","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,23]]}}}