{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:18Z","timestamp":1740145158455,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T00:00:00Z","timestamp":1468281600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of Hunan Province, China","award":["13JJ2001"],"award-info":[{"award-number":["13JJ2001"]}]},{"name":"Science Project of National University of Defense Technology","award":["JC120201"],"award-info":[{"award-number":["JC120201"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61402495"],"award-info":[{"award-number":["61402495"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s11590-016-1062-0","type":"journal-article","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T02:15:19Z","timestamp":1468289719000},"page":"801-815","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Convergence of iterative hard-thresholding algorithm with continuation"],"prefix":"10.1007","volume":"11","author":[{"given":"Tao","family":"Sun","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":[[2016,7,12]]},"reference":[{"issue":"4","key":"1062_CR1","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1062_CR2","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"5","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 5(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5\u20136","key":"1062_CR3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14(5\u20136), 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1062_CR4","doi-asserted-by":"crossref","unstructured":"Blumensath, T., Yaghoobi, M., Davies, M.E.: Iterative hard thresholding and $$\\ell _0$$ \u2113 0 regularisation. In: IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007, vol. 3, pp. III-877\u2013III-880. IEEE (2007)","DOI":"10.1109\/ICASSP.2007.366820"},{"issue":"1\u20132","key":"1062_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"1062_CR6","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Proximal algorithms. Found. Trends Optim."},{"issue":"3","key":"1062_CR7","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for KL functions and general convergence rates. J. Optim. Theory Appl. 165(3), 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1062_CR8","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation for $$\\ell _1$$ \u2113 1 -minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"1062_CR9","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for $$\\ell _1$$ \u2113 1 -regularized minimization with applications to compressed sensing. CAAM TR07-07, vol. 43, p. 44, Rice University (2007)"},{"issue":"2","key":"1062_CR10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10208-011-9084-6","volume":"11","author":"D Goldfarb","year":"2011","unstructured":"Goldfarb, D., Ma, S.: Convergence of fixed-point continuation algorithms for matrix rank minimization. Found. Comput. Math. 11(2), 183\u2013210 (2011)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"1062_CR11","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., et al.: 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":"615\u2013640","key":"1062_CR12","first-page":"15","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K.C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6(615\u2013640), 15 (2010)","journal-title":"Pac. J. Optim."},{"key":"1062_CR13","doi-asserted-by":"crossref","unstructured":"Jiao, Y., Jin, B., Lu, X.: A primal dual active set with continuation algorithm for the L0-regularized optimization problem. Appl. Comput. Harmon. Anal. 39(3), 400\u2013426 (2015)","DOI":"10.1016\/j.acha.2014.10.001"},{"key":"1062_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-31247-1","volume-title":"Variational Analysis and Generalized Differentiation I: Basic Theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory. Springer Science & Business Media, Berlin (2006)"},{"key":"1062_CR15","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer Science & Business Media, Berlin (2009)"},{"key":"1062_CR16","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (2015)"},{"issue":"1\u20132","key":"1062_CR17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1062_CR18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s11228-004-7197-7","volume":"13","author":"AS Lewis","year":"2005","unstructured":"Lewis, A.S., Sendov, H.S.: Nonsmooth analysis of singular values, part I: theory. Set Valued Anal. 13, 213\u2013241 (2005)","journal-title":"Set Valued Anal."},{"issue":"1\u20132","key":"1062_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1062-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1062-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1062-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1062-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T21:14:35Z","timestamp":1568150075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1062-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1062"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1062-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,7,12]]}}}