{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T04:05:00Z","timestamp":1754021100407},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11590-023-01991-0","type":"journal-article","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T12:02:44Z","timestamp":1679400164000},"page":"291-305","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["k-sparse vector recovery via Truncated $$\\ell _1-\\ell _2$$ local minimization"],"prefix":"10.1007","volume":"18","author":[{"given":"Shaohua","family":"Xie","sequence":"first","affiliation":[]},{"given":"Jia","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,21]]},"reference":[{"key":"1991_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.acha.2021.09.003","volume":"56","author":"N Bi","year":"2022","unstructured":"Bi, N., Tang, W.: A necessary and sufficient condition for sparse vector recovery via $$\\ell _1-\\ell _2$$ minimization. Appl. Comput. Harmon. Anal. 56, 337\u2013350 (2022)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"1991_CR2","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1137\/16M1098929","volume":"10","author":"T Ma","year":"2017","unstructured":"Ma, T., Lou, Y., Huang, T.: Truncated $$l_{1-2}$$ Models for Sparse Recovery and Rank Minimization. SIAM J. Imag. Sci. 10(3), 1346\u20131380 (2017)","journal-title":"SIAM J. Imag. Sci."},{"key":"1991_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1991_CR4","volume-title":"A Mathematical Introduction to Compressive Sensing, Applied and Numerical Harmonic Analysis Series","author":"S Foucart","year":"2013","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing, Applied and Numerical Harmonic Analysis Series. Springer, New York\/Birkh auser (2013)"},{"issue":"1","key":"1991_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.acha.2009.10.004","volume":"29","author":"S Foucart","year":"2010","unstructured":"Foucart, S.: A note on guaranteed sparse recovery via -minimization. Appl. Comput. Harmon. Anal. 29(1), 97\u2013103 (2010)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"1991_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TIT.2005.860430","volume":"52","author":"D Donoho","year":"2005","unstructured":"Donoho, D., Elad, M., Temlyakov, V.: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52(1), 6\u201318 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1991_CR7","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.acha.2011.04.005","volume":"31","author":"Q Mo","year":"2011","unstructured":"Mo, Q., Li, S.: New bounds on the restricted isometry constant $$\\delta _{2k}$$. Appl. Comput. Harmon. Anal. 31(3), 460\u2013468 (2011)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"1991_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10957-014-0581-z","volume":"164","author":"H Zhang","year":"2012","unstructured":"Zhang, H., Yin, W., Cheng, L.: Necessary and sufficient conditions of solution uniqueness in $$\\ell _1$$ minimization. J. Optim. Theory Appl. 164(1), 109\u2013122 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132","key":"1991_CR9","first-page":"301","volume":"149","author":"W Bian","year":"2014","unstructured":"Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. 149(1\u20132), 301\u2013327 (2014)","journal-title":"Math. Program."},{"issue":"5","key":"1991_CR10","doi-asserted-by":"publisher","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions of l2-l p minimization. SIAM J. Sci. Comput. 32(5), 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"10","key":"1991_CR11","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"issue":"3","key":"1991_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","volume":"26","author":"S Foucart","year":"2009","unstructured":"Foucart, S., Lai, M.: Sparsest solutions of underdetermined linear systems via q-minimization for $$0<q \\le 1$$. Appl. Comput. Harmon. Anal. 26(3), 395\u2013407 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"1991_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.acha.2017.10.004","volume":"47","author":"R Zhang","year":"2017","unstructured":"Zhang, R., Li, S.: Optimal RIP bounds for sparse signals recovery via p minimization. Appl. Comput. Harmon. Anal. 47(3), 566\u2013584 (2017)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1991_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-18161-5_15","volume":"359","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Osher, S., Xin, J.: Computational aspects of constrained L1\u2013L2 minimization for compressive sensing. Adv. Intell. Syst. Comput. 359, 169\u2013180 (2015)","journal-title":"Adv. Intell. Syst. Comput."},{"key":"1991_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Yin, P., He, Q.: Computing sparse representation in a highly coherent dictionary based on difference of L1 and L2. J. Sci. Comput. 64, 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1991_CR16","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/20M136517X","volume":"14","author":"H Ge","year":"2021","unstructured":"Ge, H., Chen, W., Ng, M.: New restricted isometry property analysis for $$\\ell _1-\\ell _2$$ minimization methods. SIAM J. Imaging Sci. 14(2), 530\u2013557 (2021)","journal-title":"SIAM J. Imaging Sci."},{"issue":"5","key":"1991_CR17","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ab750c","volume":"36","author":"P Li","year":"2020","unstructured":"Li, P., Chen, W., Ge, H.: $$\\ell _1-\\alpha \\ell _2$$ minimization methods for signal and image reconstruction with impulsive noise removal. Inverse Prob. 36(5), 055009 (2020)","journal-title":"Inverse Prob."},{"issue":"1","key":"1991_CR18","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Qi, H.: Minimization of l(1\u20132) for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1991_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s40305-014-0043-1","volume":"2","author":"Y Zhao","year":"2014","unstructured":"Zhao, Y.: Equivalence and strong equivalence between the sparsest and least $$\\ell _1$$-norm nonnegative solutions of linear systems and their applications. J. Oper. Res. Soc. China 2(2), 171\u2013193 (2014)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"22","key":"1991_CR20","doi-asserted-by":"publisher","first-page":"5777","DOI":"10.1109\/TSP.2013.2281030","volume":"61","author":"Y Zhao","year":"2013","unstructured":"Zhao, Y.: RSP-based analysis for sparsest and lease $$\\ell _1$$ norm solutions to underdetermined linear systems. IEEE Trans. Signal Process. 61(22), 5777\u20135788 (2013)","journal-title":"IEEE Trans. Signal Process."},{"key":"1991_CR21","first-page":"1","volume":"99","author":"C Wang","year":"2020","unstructured":"Wang, C., Yan, M., Rahimi, Y.: Accelerated schemes for the $$L_1\/L_2$$ minimization. IEEE Trans. Signal Process. 99, 1\u20131 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"1991_CR22","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, Y.: Fast L1\u2013L2 minimization via a proximal operator. J. Sci. Comput. 74(2), 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1991_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3934\/mfc.2020006","volume":"3","author":"P Geng","year":"2020","unstructured":"Geng, P., Chen, W.: Unconstrained $$\\ell _1-\\ell _2$$ minimization for sparse recovery via mutual coherence. Math. Found. Comput. 3(2), 65\u201379 (2020)","journal-title":"Math. Found. Comput."},{"issue":"1","key":"1991_CR24","doi-asserted-by":"publisher","first-page":"A229","DOI":"10.1137\/15M103947X","volume":"39","author":"Y Shin","year":"2017","unstructured":"Shin, Y., Xiu, D.: Sparse approximation using l(1)-l(2) minimization and its application to stochastic collocation. SIAM J. Sci. Comput. 39(1), A229\u2013A254 (2017)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"1991_CR25","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1142\/S0219530521500068","volume":"19","author":"N Bi","year":"2021","unstructured":"Bi, N., Tan, J., Tang, W.: A new sufficient condition for sparse vector recovery via L1\u2013L2 local minimization. Anal. Appl. 19(6), 1019\u20131031 (2021)","journal-title":"Anal. Appl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01991-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01991-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01991-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T06:23:12Z","timestamp":1704867792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01991-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,21]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1991"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01991-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,21]]},"assertion":[{"value":"9 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}