{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:05:29Z","timestamp":1783530329693,"version":"3.55.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T00:00:00Z","timestamp":1643328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T00:00:00Z","timestamp":1643328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12031003"],"award-info":[{"award-number":["12031003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771347"],"award-info":[{"award-number":["11771347"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10898-022-01126-2","type":"journal-article","created":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T09:02:41Z","timestamp":1643360561000},"page":"783-801","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Sparse signal recovery via generalized gaussian function"],"prefix":"10.1007","volume":"83","author":[{"given":"Haiyang","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shoujin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,28]]},"reference":[{"issue":"11","key":"1126_CR1","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311\u20134322 (2006)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1126_CR2","first-page":"23","volume":"133","author":"TH Anl","year":"2005","unstructured":"Anl, T.H., Tao, P.D.: The DC programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1126_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/TIP.2009.2032894","volume":"19","author":"SD Babacan","year":"2010","unstructured":"Babacan, S.D., Molina, R., Katsaggelos, A.K.: Bayesian compressive sensing using laplace priors. IEEE Trans. Image Process. 19(1), 53\u201363 (2010)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"1126_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.A.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"5","key":"1126_CR5","doi-asserted-by":"publisher","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), 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1126_CR6","doi-asserted-by":"crossref","unstructured":"Cand$$\\grave{e}$$s, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. , 59(8), 1207\u20131223 (2006)","DOI":"10.1002\/cpa.20124"},{"key":"1126_CR7","doi-asserted-by":"crossref","unstructured":"Cand$$\\grave{e}$$s, E., Rudelson, M., Tao, T., Vershynin, R.: Error correction via linear programming. In: 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 668-681. Pittsburgh, PA (2005)","DOI":"10.1109\/SFCS.2005.5464411"},{"key":"1126_CR8","doi-asserted-by":"crossref","unstructured":"Cand$$\\grave{e}$$s, E., Tao, T.: Decoding by linear programming, IEEE Trans. Inform. Theory 51(12), 4203\u20134215 (2005)","DOI":"10.1109\/TIT.2005.858979"},{"issue":"1","key":"1126_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"W Cao","year":"2003","unstructured":"Cao, W., Sun, J., Xu, Z.: Fast image deconvolution using closed-form thresholding formulas of regularization. J. Vis. Commun. Image Represent. 24(1), 31\u201341 (2003)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"1126_CR10","unstructured":"Carmy, A., Gurfil, P., Kanevsky, D., Ramabhadran, B.: ABCS: approximate Bayesian compressed sensing. IBM Research Report, RC24816 (2009)"},{"issue":"10","key":"1126_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. 14(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process."},{"issue":"5","key":"1126_CR12","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/TIT.2009.2016030","volume":"55","author":"ME Davies","year":"2009","unstructured":"Davies, M.E., Gribonval, R.: Restricted isometry constants where $$l_p$$ sparse recovery can fail for $$0<p<1$$. IEEE Trans. Inform. Theory 55(5), 2203\u20132214 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1126_CR13","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1126_CR14","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho, D.L.: De-noising by soft thresholding. IEEE Trans. Inform. Theory 41(3), 613\u2013627 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1126_CR15","doi-asserted-by":"crossref","unstructured":"Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthoganal) dictionaries via $$l_1$$ minimization. In: Proceedings of Nature Academic Sciences, pp. 2197\u20132202. USA (2003)","DOI":"10.1073\/pnas.0437847100"},{"issue":"27","key":"1126_CR16","doi-asserted-by":"publisher","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. PNAS 102(27), 9446\u20139451 (2005)","journal-title":"PNAS"},{"key":"1126_CR17","doi-asserted-by":"publisher","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. Springe Press, New York (2010)"},{"issue":"11","key":"1126_CR18","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765\u20132781 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"1126_CR19","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1006\/cgip.1993.1040","volume":"55","author":"CA Glasbey","year":"1993","unstructured":"Glasbey, C.A.: An analysis of histogram-based thresholding algorithm. CVGIP Graph. Models Image Process. 55(6), 532\u2013537 (1993)","journal-title":"CVGIP Graph. Models Image Process."},{"issue":"2","key":"1126_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein, T., Osher, S.: The Split Bregman Method for $$\\ell _1$$-regularized Problems. SIAM J. Imag. Sci. 2(2), 323\u2013343 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"1126_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoain, V., Programming, D.C.: Overview. J. Optim. Appl. 103(1), 1\u201343 (1999)","journal-title":"J. Optim. Appl."},{"issue":"8","key":"1126_CR22","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1109\/TSP.2007.914345","volume":"52","author":"S Ji","year":"2008","unstructured":"Ji, S., Xue, Y., Carin, L.: Bayesian compressive sensing. IEEE Trans. Signal Process. 52(8), 2346\u20132356 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"1126_CR23","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Thi, B.T.N., Le, H.M.: Sparse signal recovery by difference of convex functions algorithms. In: Intelligent Information and Database Systems, vol. 7803, pp. 387\u2013397, Berlin, Germany (2013)","DOI":"10.1007\/978-3-642-36543-0_40"},{"issue":"5","key":"1126_CR24","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1109\/TNNLS.2019.2921404","volume":"31","author":"H Li","year":"2020","unstructured":"Li, H., Zhang, Q., Cui, A., Peng, J.: Minimization of fraction function penalty in compressed sensing. IEEE Trans. Neural Netw. Learn. Syst. 31(5), 1626\u20131637 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"1126_CR25","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2013","unstructured":"Liu, G., Lin, Z., Yan, S.: Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 171\u2013184 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1126_CR26","unstructured":"Louizos, C., Welling, M., Kingma, D.: Learning sparse neural networks through $$\\ell _0$$ Regularization (2017). arXiv preprint arXiv:1712.01312"},{"issue":"3","key":"1126_CR27","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/18.761332","volume":"45","author":"P Moulin","year":"1999","unstructured":"Moulin, P., Liu, J.: Analysis of multiresolution image denoising schemes using generalized Gaussian and complexity priors. IEEE Trans. Inform. Theory 45(3), 909\u2013919 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1126_CR28","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B Natarajan","year":"1995","unstructured":"Natarajan, B.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1126_CR29","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0764-4442(97)84780-5","volume":"325","author":"M Nikolova","year":"1997","unstructured":"Nikolova, M.: Estim\u00e9es locales fortement homog\u00e8nes. Comptes Rendus Acad. Sci. Paris 325(1), 665\u2013670 (1997)","journal-title":"Comptes Rendus Acad. Sci. Paris"},{"issue":"4","key":"1126_CR30","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1080\/10556788.2011.652630","volume":"28","author":"CS Ong","year":"2013","unstructured":"Ong, C.S., Hoai An, L.T.: An learning sparse classifiers with difference of convex functions algorithms. Optim. Methods Softw. 28(4), 830\u2013854 (2013)","journal-title":"Optim. Methods Softw."},{"key":"1126_CR31","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.neucom.2017.02.029","volume":"241","author":"S Scardapane","year":"2017","unstructured":"Scardapane, S., Comminiello, D., Hussain, A., Uncini, A.: Group sparse regularization for deep neural networks. Neurocomputing 241, 81\u201389 (2017)","journal-title":"Neurocomputing"},{"issue":"1","key":"1126_CR32","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., Hoai An, L.T.: Convex analysis approach to D.c. programming: theory, algorithms and application. Acta Mathematica Vietenamica 22(1), 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietenamica"},{"issue":"4","key":"1126_CR33","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s003659900090","volume":"14","author":"VN Temlyakov","year":"1998","unstructured":"Temlyakov, V.N.: Greedy algorithm and $$m$$-term trigonometric approximation. Construct. Approx. 14(4), 569\u2013587 (1998)","journal-title":"Construct. Approx."},{"key":"1126_CR34","unstructured":"Thiao, M.: Approches de la programmation DC et DCA en data mining, Th$$\\grave{e}$$se de doctorat $$\\grave{a}$$ 1\u2019INSA-Rouen, France (2011)"},{"issue":"1","key":"1126_CR35","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression Shrinkage and Selection via the Lasso. J. Roy. Stat. Soc. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. Roy. Stat. Soc. Ser. B"},{"issue":"12","key":"1126_CR36","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J Tropp","year":"2007","unstructured":"Tropp, J., Gillbert, A.: Signal recovery from partial information via orthogonal matching pursuit. IEEE Trans. Inform. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1126_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69, 1\u201328 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"7","key":"1126_CR38","doi-asserted-by":"publisher","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(7), 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"1126_CR39","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell _1$$ problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1126_CR40","doi-asserted-by":"publisher","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$$-minimization with applications to compressed sensing. SIAM J. Imag. Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imag. Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01126-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01126-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01126-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T14:12:23Z","timestamp":1726582343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01126-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,28]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1126"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01126-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,28]]},"assertion":[{"value":"26 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}