{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T01:33:04Z","timestamp":1769304784353,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1115523"],"award-info":[{"award-number":["DMS-1115523"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>An accurate and efficient algorithm for solving the constrained <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>1<\/jats:sub>-norm minimization problem is highly needed and is crucial for the success of sparse signal recovery in compressive sampling. We tackle the constrained <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>1<\/jats:sub>-norm minimization problem by reformulating it via an indicator function which describes the constraints. The resulting model is solved efficiently and accurately by using an elegant proximity operator-based algorithm. Numerical experiments show that the proposed algorithm performs well for sparse signals with magnitudes over a high dynamic range. Furthermore, it performs significantly better than the well-known algorithm NESTA (a shorthand for Nesterov\u2019s algorithm) and DADM (dual alternating direction method) in terms of the quality of restored signals and the computational complexity measured in the CPU-time consumed.<\/jats:p>","DOI":"10.1186\/s13634-015-0247-5","type":"journal-article","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T10:46:37Z","timestamp":1438339597000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A fast and accurate algorithm for \u2113\n\t\t\t                  1 minimization problems in compressive sampling"],"prefix":"10.1186","volume":"2015","author":[{"given":"Feishe","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixin","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce W.","family":"Suter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuesheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"issue":"8","key":"247_CR1","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E Candes","year":"2006","unstructured":"E Candes, J Romberg, T Tao, Stable signal recovery from incomplete and inaccurate measurements. Commun. Pur. Appl. Math. 59(8), 1207\u20131223 (2006).","journal-title":"Commun. Pur. Appl. Math."},{"issue":"12","key":"247_CR2","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E Candes","year":"2006","unstructured":"E Candes, T Tao, Near optimal signal recovery from random projections: universal encoding strategies?IEEE Trans. Inf. Theory. 52(12), 5406\u20135425 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"247_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"SS Chen, DL Donoho, MA Saunders, Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998).","journal-title":"SIAM J. Sci. Comput."},{"key":"247_CR4","doi-asserted-by":"crossref","unstructured":"SJ Wright, Primal-Dual Interior-Point Methods (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997).","DOI":"10.1137\/1.9781611971453"},{"key":"247_CR5","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P Combettes","year":"2005","unstructured":"P Combettes, V Wajs, Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. A SIAM Interdiscip. J. 4, 1168\u20131200 (2005).","journal-title":"Multiscale Model. Simul. A SIAM Interdiscip. J."},{"key":"247_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"MAT Figueiredo, SJ Wright, RD Nowak, Gradient projection for sparse reconstruction: applications to compressed sensing and other inverse problems. IEEE J. Selected Topics Signal Process. 1, 586\u2013597 (2007).","journal-title":"IEEE J. Selected Topics Signal Process."},{"key":"247_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"A Beck, M Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009).","journal-title":"SIAM J. Imaging Sci."},{"key":"247_CR8","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"ET Hale, W Yin, Y Zhang, Fixed-point continuation for \u2113\n\t\t\t\t\t                      1 minimization: methodology and convergence. SIAM J. Optim. 19, 1107\u20131130 (2008).","journal-title":"SIAM J. Optim."},{"key":"247_CR9","first-page":"337","volume":"2","author":"J-F Cai","year":"2009","unstructured":"J-F Cai, S Osher, Z Shen, Split Bregman methods and frame based image restoration. Multiscale Model. Simul.: A SIAM Interdiscip. J. 2, 337\u2013369 (2009).","journal-title":"Multiscale Model. Simul.: A SIAM Interdiscip. J."},{"key":"247_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"W Yin, S Osher, D Goldfarb, J Darbon, Bregman iterative algorithms for \u2113\n\t\t\t\t\t                      1 minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1, 143\u2013168 (2008).","journal-title":"SIAM J. Imaging Sci."},{"key":"247_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/83.661182","volume":"7","author":"A Chambolle","year":"1998","unstructured":"A Chambolle, RA DeVore, N-Y Lee, BJ Lucier, Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEE Trans. Image Process. 7, 319\u2013335 (1998).","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"247_CR12","doi-asserted-by":"publisher","first-page":"1408","DOI":"10.1137\/S1064827500383123","volume":"24","author":"R Chan","year":"2003","unstructured":"R Chan, T Chan, L Shen, Z Shen, Wavelet algorithms for high-resolution image reconstruction. SIAM J. Sci. Comput. 24(4), 1408\u20131432 (2003).","journal-title":"SIAM J. Sci. Comput."},{"key":"247_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"B Efron, T Hastie, I Johnstone, R Tibshirani, Least angle regression. Ann. Stat. 32, 407\u2013451 (2004).","journal-title":"Ann. Stat."},{"key":"247_CR14","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1093\/imanum\/20.3.389","volume":"20","author":"MR Osborne","year":"2000","unstructured":"MR Osborne, B Presnell, BA Turlach, A new approach to variable selection in least squares problems. IMA J. Numeric. Anal. 20, 389\u2013403 (2000).","journal-title":"IMA J. Numeric. Anal."},{"issue":"11","key":"247_CR15","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"D Donoho","year":"2008","unstructured":"D Donoho, Y Tsaig, Fast solution of \u2113\n\t\t\t\t\t                      1-norm minimization problems when the solution may be sparse. IEEE Trans. Inf. Theory. 54(11), 4789\u20134812 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"247_CR16","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E van den Berg","year":"2008","unstructured":"E van den Berg, MP Friedlander, Probing the Pareto frontier for basis pursuit solutions. SIAM J. Scie. Comput. 31, 890\u2013912 (2008).","journal-title":"SIAM J. Scie. Comput."},{"key":"247_CR17","unstructured":"RT Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."},{"issue":"1","key":"247_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/090756855","volume":"4","author":"S Becker","year":"2009","unstructured":"S Becker, J Bobin, E Candes, NESTA: a fast and accurate first-order method for sparse recovery. SIAM J. Imaging Sci. 4(1), 1\u201339 (2009).","journal-title":"SIAM J. Imaging Sci."},{"key":"247_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Y Nesterov, Smooth minimization of non-smooth functions. Mathematical Programming, Series A. 103, 127\u2013152 (2005).","journal-title":"Mathematical Programming, Series A"},{"key":"247_CR20","doi-asserted-by":"publisher","first-page":"095003","DOI":"10.1088\/0266-5611\/28\/9\/095003","volume":"28","author":"Q Li","year":"2012","unstructured":"Q Li, CA Micchelli, L Shen, Y Xu, A proximity algorithm accelerated by Gauss-Seidel iterations for L1\/TV denoising models. Inverse Probl. 28, 095003 (2012).","journal-title":"Inverse Probl."},{"key":"247_CR21","doi-asserted-by":"publisher","first-page":"045009","DOI":"10.1088\/0266-5611\/27\/4\/045009","volume":"27","author":"CA Micchelli","year":"2011","unstructured":"CA Micchelli, L Shen, Y Xu, Proximity algorithms for image models: denoising. Inverse Probl. 27, 045009\u201330 (2011).","journal-title":"Inverse Probl."},{"key":"247_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10444-011-9243-y","volume":"38","author":"CA Micchelli","year":"2013","unstructured":"CA Micchelli, L Shen, Y Xu, X Zeng, Proximity algorithms for the L1\/TV image denoising model. Adv. Comput. Math. 38, 401\u2013426 (2013).","journal-title":"Adv. Comput. Math."},{"key":"247_CR23","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"J Yang, Y Zhang, Alternating direction algorithms for l1-problems in compressive sensing. SIAM J. Scie. Comput. 33, 250\u2013278 (2011).","journal-title":"SIAM J. Scie. Comput."},{"key":"247_CR24","doi-asserted-by":"crossref","unstructured":"W Deng, W Yin, On the global and linear convergence of the generalized alternating direction method of multipliers (ADMM). Technical report, UCLA, Center for Applied Mathematics (2012).","DOI":"10.21236\/ADA567407"},{"key":"247_CR25","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10915-010-9408-8","volume":"46","author":"X Zhang","year":"2011","unstructured":"X Zhang, M Burger, S Osher, A unified primal-dual algorithm framework based on Bregman iteration. J. Sci. Comput. 46, 20\u201346 (2011).","journal-title":"J. Sci. Comput."},{"key":"247_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","unstructured":"S Boyd, N Parikh, E Chu, B Peleato, J Eckstein, Distributed optimization and statistical learning via alternating direction method of multipliers. Foundations Trends Mach. Learn. 3, 1\u2013122 (2010).","journal-title":"Foundations Trends Mach. Learn."},{"key":"247_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"A Chambolle, T Pock, A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40, 120\u2013145 (2011).","journal-title":"J. Math. Imaging Vis."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0247-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13634-015-0247-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0247-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0247-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T17:46:01Z","timestamp":1630604761000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-015-0247-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["247"],"URL":"https:\/\/doi.org\/10.1186\/s13634-015-0247-5","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,1]]},"assertion":[{"value":"9 April 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"65"}}