{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T00:53:24Z","timestamp":1774745604475,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,26]],"date-time":"2015-12-26T00:00:00Z","timestamp":1451088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11501569"],"award-info":[{"award-number":["11501569"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61072118"],"award-info":[{"award-number":["61072118"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11590-015-0983-3","type":"journal-article","created":{"date-parts":[[2015,12,25]],"date-time":"2015-12-25T21:39:12Z","timestamp":1451079552000},"page":"55-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Projected shrinkage algorithm for box-constrained $$\\ell _1$$ \u2113 1 -minimization"],"prefix":"10.1007","volume":"11","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LiZhi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,26]]},"reference":[{"key":"983_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator theory in Hilbert Spaces. Springer, Berlin (2011)"},{"issue":"1","key":"983_CR2","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":"11","key":"983_CR3","doi-asserted-by":"crossref","first-page":"4813","DOI":"10.1109\/TIT.2008.929920","volume":"54","author":"AM Bruckstein","year":"2008","unstructured":"Bruckstein, A.M., Elad, M., Zibulevsky, M.: On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations. IEEE Trans. Inf Theory 54(11), 4813\u20134820 (2008)","journal-title":"IEEE Trans. Inf Theory"},{"issue":"267","key":"983_CR4","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1090\/S0025-5718-08-02189-3","volume":"78","author":"J-F Cai","year":"2009","unstructured":"Cai, J.-F., Osher, S., Shen, Z.: Linearized Bregman iterations for compressed sensing. Math. Comput. 78(267), 1515\u20131536 (2009)","journal-title":"Math. Comput."},{"issue":"1","key":"983_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"S Chen","year":"2001","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"4","key":"983_CR6","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(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"27","key":"983_CR7","doi-asserted-by":"crossref","first-page":"9446","DOI":"10.1073\/pnas.0502269102","volume":"102","author":"DL Donoho","year":"2005","unstructured":"Donoho, D.L., Tanner, J.: Sparse nonnegative solution of underdetermined linear equations by linear programming. Proc. Natl. Acad. Sci. 102(27), 9446\u20139451 (2005)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"983_CR8","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O G\u00fcler","year":"1991","unstructured":"G\u00fcler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29(2), 403\u2013419 (1991)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"983_CR9","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/120863290","volume":"6","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Yin, W.: Augmented $$\\ell _1$$ \u2113 1 and nuclear-norm models with a globally linearly convergent algorithm. SIAM. J. Imaging Sci. 6(2), 1059\u20131091 (2013)","journal-title":"SIAM. J. Imaging Sci."},{"key":"983_CR10","first-page":"2897","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: Fonctions convexes duales et points proximaux dans un espace hilbertien. C. R. Acad. Sci. Paris Ser. A Math. 255, 2897\u20132899 (1962)","journal-title":"C. R. Acad. Sci. Paris Ser. A Math."},{"key":"983_CR11","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.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Berlin (2004)"},{"issue":"3","key":"983_CR12","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., Cand\u00e8s, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"983_CR13","doi-asserted-by":"crossref","unstructured":"Parikh, N., Boyd, S.: Proximal algorithm. Found. Trends Optim. 1(3), 123\u2013231 (2014)","DOI":"10.1561\/2400000003"},{"key":"983_CR14","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)","DOI":"10.1515\/9781400873173"},{"issue":"5","key":"983_CR15","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SlAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SlAM J. Control Optim."},{"key":"983_CR16","unstructured":"Tak\u00e1c\u0306, M., Marec\u0306ek, J., Richt\u00e1rik, P.: Inequality-Constrained Matrix Completion: Adding the Obvious Helps! arXiv:1408.2467v1 [math.OC] (2014)"},{"issue":"9","key":"983_CR17","doi-asserted-by":"crossref","first-page":"4595","DOI":"10.1109\/TSP.2010.2051150","volume":"58","author":"N Vaswani","year":"2010","unstructured":"Vaswani, N., Lu, W.: Modified-CS: modifying compressive sensing for problems with partially known support. IEEE Trans. Signal Process. 58(9), 4595\u20134607 (2010)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"983_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for $$\\ell _1$$ \u2113 1 -minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"983_CR19","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.acha.2011.04.004","volume":"31","author":"H Zhang","year":"2011","unstructured":"Zhang, H., Cheng, L., Zhu, W.: A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm. Appl. Comput. Harmonic Anal. 31(3), 454\u2013459 (2011)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"2","key":"983_CR20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3934\/ipi.2012.6.357","volume":"6","author":"H Zhang","year":"2012","unstructured":"Zhang, H., Cai, J.-F., Cheng, L., Zhu, J.: Strongly convex programming for exact matrix completion and robust principal component analysis. Inverse Probl. Imaging 6(2), 357\u2013372 (2012)","journal-title":"Inverse Probl. Imaging"},{"key":"983_CR21","unstructured":"Zhang, H., Yin, W.: Gradient methods for convex minimization: better rates under weaker conditions. In: UCLA CAM Report (13\u201317), 2013"},{"issue":"1","key":"983_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4310\/CMS.2015.v13.n1.a5","volume":"13","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Cheng, L.Z., Yin, W.: Dual algorithm for a class of augmented convex signal recovery models. Commun. Math. Sci. 13(1), 103\u2013112 (2015)","journal-title":"Commun. Math. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0983-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0983-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0983-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0983-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:44Z","timestamp":1559394704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0983-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,26]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["983"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0983-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,26]]}}}