{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:21Z","timestamp":1740123561840,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2021YFA1003305"],"award-info":[{"award-number":["2021YFA1003305"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371382"],"award-info":[{"award-number":["12371382"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10915-023-02393-1","type":"journal-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T06:01:35Z","timestamp":1700632895000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scaled Proximal Gradient Methods for Sparse Optimization Problems"],"prefix":"10.1007","volume":"98","author":[{"given":"Guiyun","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuqin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5134-3500","authenticated-orcid":false,"given":"Zheng-Jian","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,22]]},"reference":[{"key":"2393_CR1","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"2393_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"key":"2393_CR3","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44, 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"2393_CR4","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.sigpro.2011.09.017","volume":"92","author":"T Blumensath","year":"2012","unstructured":"Blumensath, T.: Accelerated iterative hard thresholding. Signal Process. 92, 752\u2013756 (2012)","journal-title":"Signal Process."},{"key":"2393_CR5","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 hard thresholding for sparse approximation. J. Fourier Anal. Appl. 14, 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"2393_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27, 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2393_CR7","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath, T., Davies, M.E.: Normalized iterative hard thresholding: guaranteed stability and performance. IEEE J. Sel. Top. Signal Process. 4, 298\u2013309 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"2393_CR8","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, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"2393_CR9","first-page":"15","volume":"68","author":"JF Bonnans","year":"1995","unstructured":"Bonnans, J.F., Gilbert, JCh., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: A family of variable metric proximal methods. Math. Program. 68, 15\u201347 (1995)","journal-title":"Math. Program."},{"key":"2393_CR10","unstructured":"Cand\u00e8s, E.J.: Compressive sampling. In: Proceedings of the International Congress of Mathematicians, Madrid, Spain (2006)"},{"key":"2393_CR11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2393_CR12","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2393_CR13","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$-minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"2393_CR14","doi-asserted-by":"crossref","unstructured":"Cevher, V.: On accelerated hard thresholding methods for sparse approximation. In: Proceedings of SPIE Optical Engineering + Applications, Wavelets and Sparsity XIV, 813811 (2011)","DOI":"10.1117\/12.894386"},{"key":"2393_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"2393_CR16","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55, 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2393_CR17","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1117\/12.173207","volume":"33","author":"GM Davis","year":"1994","unstructured":"Davis, G.M., Mallat, S.G., Zhang, Z.: Adaptive time-frequency decompositions. Opt. Eng. 33, 2183\u20132191 (1994)","journal-title":"Opt. Eng."},{"key":"2393_CR18","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, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2393_CR19","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho, D.L.: De-noising by soft-thresholdinng. IEEE Trans. Inf. Theory 41, 613\u2013627 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2393_CR20","doi-asserted-by":"crossref","first-page":"5559","DOI":"10.1109\/TIT.2006.885522","volume":"52","author":"M Elad","year":"2006","unstructured":"Elad, M.: Why simple shrinkage is still relevant for redundant representation? IEEE Trans. Inf. Theory 52, 5559\u20135569 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2393_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant Representations: From Theory to Applications in Signal and Image Processing","author":"M Elad","year":"2010","unstructured":"Elad, M.: Sparse and redundant Representations: From Theory to Applications in Signal and Image Processing. Springer, New York (2010)"},{"key":"2393_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511794308","volume-title":"Compressed Sensing: Theory and Applications","author":"YC Eldar","year":"2012","unstructured":"Eldar, Y.C., Kutyniok, G.: Compressed Sensing: Theory and Applications. Cambridge University Press, Cambridge (2012)"},{"key":"2393_CR23","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart, S.: Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49, 2543\u20132563 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"2393_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"S Foucart","year":"2013","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Springer, New York (2013)"},{"key":"2393_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139088497","volume-title":"Compressive Sensing for Wireless Networks","author":"Z Han","year":"2013","unstructured":"Han, Z., Li, H., Yin, W.: Compressive Sensing for Wireless Networks. Cambridge University Press, Cambridge (2013)"},{"key":"2393_CR26","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/TPAMI.2005.92","volume":"27","author":"KC Lee","year":"2005","unstructured":"Lee, K.C., Ho, J., Kriegman, D.J.: Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27, 684\u2013698 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2393_CR27","doi-asserted-by":"crossref","unstructured":"Liu, H., Yue, M.C., So, A.M.C., Ma, W.K.: A discrete first-order method for large-scale MIMO detection with provable guarantees. In: Proceedings of the IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (2017)","DOI":"10.1109\/SPAWC.2017.8227768"},{"key":"2393_CR28","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"SG Mallat","year":"1993","unstructured":"Mallat, S.G., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41, 3397\u20133415 (1993)","journal-title":"IEEE Trans. Signal Process."},{"key":"2393_CR29","doi-asserted-by":"crossref","first-page":"6594","DOI":"10.1109\/TSP.2020.3037996","volume":"68","author":"N Meng","year":"2020","unstructured":"Meng, N., Zhao, Y.B.: Newton-step-based hard thresholding algorithms for sparse signal recovery. IEEE Trans. Signal Process. 68, 6594\u20136606 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"2393_CR30","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035933","volume-title":"Subset Selection in Regression","author":"A Miller","year":"2002","unstructured":"Miller, A.: Subset Selection in Regression, 2nd edn. Chapman and Hall, London (2002)","edition":"2"},{"key":"2393_CR31","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24, 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"2393_CR32","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, Berlin (2006)"},{"key":"2393_CR33","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26, 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2393_CR34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1, 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"2393_CR35","doi-asserted-by":"crossref","unstructured":"Patel, V., Chellappa, R.: Sparse representations, compressive sensing and dictionaries for pattern recognition. In: Proceedings of The First Asian Conference on Pattern Recognition, pp. 325\u2013329 (2011)","DOI":"10.1109\/ACPR.2011.6166711"},{"key":"2393_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"2393_CR37","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511730344","volume-title":"Sparse Image and Signal Processing: Wavelets, Curvelets, Morphological Diversity","author":"J Starck","year":"2010","unstructured":"Starck, J., Murtagh, F., Fadili, J.: Sparse Image and Signal Processing: Wavelets, Curvelets, Morphological Diversity. Cambridge University Press, Cambridge (2010)"},{"key":"2393_CR38","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53, 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2393_CR39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151, 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"2393_CR40","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s10915-022-01873-0","volume":"92","author":"GY Xiao","year":"2022","unstructured":"Xiao, G.Y., Bai, Z.J.: A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint. J. Sci. Comput. 92, 22 (2022)","journal-title":"J. Sci. Comput."},{"key":"2393_CR41","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $$L_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2393_CR42","doi-asserted-by":"crossref","DOI":"10.1201\/9781315113142","volume-title":"Sparse Optimization Theory and Methods","author":"YB Zhao","year":"2018","unstructured":"Zhao, Y.B.: Sparse Optimization Theory and Methods. CRC Press, Boca Raton (2018)"},{"key":"2393_CR43","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/18M1219187","volume":"30","author":"YB Zhao","year":"2020","unstructured":"Zhao, Y.B.: Optimal $$k$$-thresholding algorithms for sparse optimization problems. SIAM J. Optim. 30, 31\u201355 (2020)","journal-title":"SIAM J. Optim."},{"key":"2393_CR44","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1137\/110847445","volume":"22","author":"YB Zhao","year":"2012","unstructured":"Zhao, Y.B., Li, D.: Reweighted $$\\ell _1$$-minimization for sparse solutions to underdetermined linear systems. SIAM J. Optim. 22, 1065\u20131088 (2012)","journal-title":"SIAM J. Optim."},{"key":"2393_CR45","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/moor.2016.0791","volume":"42","author":"YB Zhao","year":"2017","unstructured":"Zhao, Y.B., Luo, Z.Q.: Constructing new weighted $$\\ell _1$$-algorithms for the sparsest points of polyhedral sets. Math. Oper. Res. 42, 57\u201376 (2017)","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02393-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02393-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02393-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:09:54Z","timestamp":1704895794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02393-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,22]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["2393"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02393-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2023,11,22]]},"assertion":[{"value":"7 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"2"}}