{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:21:32Z","timestamp":1757456492522,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T00:00:00Z","timestamp":1669939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T00:00:00Z","timestamp":1669939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901382","12101247","11771275","11971302"],"award-info":[{"award-number":["11901382","12101247","11771275","11971302"]}],"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":[[2023,6]]},"DOI":"10.1007\/s10898-022-01257-6","type":"journal-article","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T08:29:45Z","timestamp":1669969785000},"page":"323-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A non-convex piecewise quadratic approximation of $$\\ell _{0}$$ regularization: theory and accelerated algorithm"],"prefix":"10.1007","volume":"86","author":[{"given":"Qian","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6195-169X","authenticated-orcid":false,"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanqin","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,2]]},"reference":[{"key":"1257_CR1","doi-asserted-by":"publisher","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, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"1257_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2008)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1257_CR3","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, 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl"},{"issue":"1","key":"1257_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1), 34\u201381 (2009)","journal-title":"SIAM Rev."},{"issue":"6","key":"1257_CR5","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2008)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"1257_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1257_CR7","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$l_{1}$$ minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"1257_CR8","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"WF Cao","year":"2013","unstructured":"Cao, W.F., Sun, J., Xu, Z.B.: Fast image deconvolution using closed-form thresholding formulas of lq (q=1\/2,2\/3) regularization. J. Vis. Commun. Image Represent 24(1), 1529\u20131542 (2013)","journal-title":"J. Vis. Commun. Image Represent"},{"issue":"1","key":"1257_CR9","doi-asserted-by":"publisher","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(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"1257_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X.M.: Stability of compressed sensing for dictionaries and almost sure convergence rate for the kaczmarz algorithm. Ph.D. thesis, Vanderbilt University (2012)","DOI":"10.1007\/s00041-012-9237-2"},{"issue":"1","key":"1257_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"Cohen, A., Dahmen, W., DeVore, R.: Compressed sensing and best k-term approximation. J Am Math Soc 22(1), 211\u2013231 (2009)","journal-title":"J Am Math Soc"},{"issue":"1","key":"1257_CR12","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., Christine, D.M.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math 57(1), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math"},{"key":"1257_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., Devore, R., Fornasier, M., Gunturk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Comm. Pure Appl. Math. 63, 1\u201338 (2010)","journal-title":"Comm. Pure Appl. Math."},{"issue":"2","key":"1257_CR14","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1109\/18.119733","volume":"38","author":"R Devore","year":"1992","unstructured":"Devore, R., Jawerth, B.: Image compression through wavelet transform coding. IEEE Trans. Inf. Theory 38(2), 719\u2013746 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1257_CR15","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. Inf. Theory 41(3), 613\u2013627 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1257_CR16","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. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1257_CR17","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Amer. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Amer. Stat. Assoc."},{"key":"1257_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for non-convex nonlinear and stochastic programming. Math. Program 156, 59\u201399 (2013)","journal-title":"Math. Program"},{"key":"1257_CR19","unstructured":"Gong, P.H., Zhang, C.S., Lu, Z.S., Huang, J.H., Ye, J.P.: A general iteartive shrinkage and thresholding algorithm for non-convex regularized optimization problems. Presented at the 30th Int. Conf. Mach. Learn. (ICML), Atlanta, GA, USA (2013)"},{"key":"1257_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2011\/854674","volume":"2011","author":"W Jing","year":"2011","unstructured":"Jing, W., Meng, D., Qiao, C., Peng, Z.: Eliminating vertical stripe defects on silicon steel surface by regularization. Math. Probl. Eng. 2011, 1\u201313 (2011)","journal-title":"Math. Probl. Eng."},{"key":"1257_CR21","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y.Y., Yin, W.T.: Improved iteratively reweighted least squares for unconstrained smoothed $$l_{q}$$ minimization. SIAM J. Numer. Anal. 51, 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"1257_CR22","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"issue":"1","key":"1257_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11425-017-9315-9","volume":"62","author":"Q Li","year":"2019","unstructured":"Li, Q., Bai, Y.Q., Yu, C.J., Yuan, Y.X.: A new piecewise quadratic approximation approach for $$l_0$$ norm minimization problem. Sci. China Math. 62(1), 185\u2013204 (2019)","journal-title":"Sci. China Math."},{"key":"1257_CR24","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41, 3397\u20133415 (1993)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"1257_CR25","doi-asserted-by":"publisher","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(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"1257_CR26","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","volume":"4","author":"D Needell","year":"2010","unstructured":"Needell, D., Vershynin, R.: Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J. Sel. Topics Signal Process. 4, 310\u2013316 (2010)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"1257_CR27","first-page":"545","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$\\cal{O} (1\/k^2)$$. Doklady AN SSSR 269, 545\u2013547 (1983)","journal-title":"Doklady AN SSSR"},{"key":"1257_CR28","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smoothing minimization of non-smooth functions. Math. Program 103, 127\u2013152 (2005)","journal-title":"Math. Program"},{"key":"1257_CR29","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1109\/TNN.2011.2157521","volume":"22","author":"A Rakotomamonjy","year":"2011","unstructured":"Rakotomamonjy, A., Flamary, R., Gasso, G., Canu, S.: lp-lq penalty for sparse linear and sparse multiple kernel multitask learning. IEEE Trans. Neural Netw. 22, 1307\u20131320 (2011)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"1257_CR30","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshiranit","year":"1996","unstructured":"Tibshiranit, R.: Regression shrinkage and selection via the lasso. J. Royal Stat. Soc. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. Royal Stat. Soc. Ser. B"},{"key":"1257_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.rinam.2019.100011","volume":"3","author":"H Tran","year":"2019","unstructured":"Tran, H., Webster, C.: A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations. Results Appl Math 3, 100011 (2019)","journal-title":"Results Appl Math"},{"key":"1257_CR32","doi-asserted-by":"publisher","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 partial information via orthogonal matching pursuit. IEEE Trans. Inf. Theor. 53, 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1257_CR33","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. SIAM J Optim (2008)"},{"issue":"1","key":"1257_CR34","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. Siam J Optim 27(1), 124\u2013145 (2017)","journal-title":"Siam J Optim"},{"key":"1257_CR35","first-page":"3151","volume":"4","author":"ZB Xu","year":"2010","unstructured":"Xu, Z.B.: Data modeling: visual psychology approach and $$l_{1\/2}$$ regularization theory. Proc. Int. Congr. Math 4, 3151\u20133184 (2010)","journal-title":"Proc. Int. Congr. Math"},{"issue":"7","key":"1257_CR36","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"ZB Xu","year":"2012","unstructured":"Xu, Z.B., Chang, X.Y., Xu, F.M., 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."},{"key":"1257_CR37","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.3724\/SP.J.1004.2012.01225","volume":"38","author":"ZB Xu","year":"2012","unstructured":"Xu, Z.B., Guo, H.L., Wang, Y., Zhang, H.: The representation of $$l_{1\/2}$$ regularizer among $$l_{q}, (0<q<1)$$ regularizer: An experimental study based on phase diagram. Acta Autom. Sin. 38, 1225\u20131228 (2012)","journal-title":"Acta Autom. Sin."},{"issue":"2","key":"1257_CR38","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"AY Yang","year":"2009","unstructured":"Yang, A.Y., Ganesh, A., Ma, Y.: Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 210\u2013227 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1257_CR39","doi-asserted-by":"publisher","first-page":"3234","DOI":"10.1109\/TIP.2013.2262292","volume":"22","author":"AY Yang","year":"2013","unstructured":"Yang, A.Y., Ganesh, A., Zhou, Z.H., Sastry, S.S., Ma, Y.: Fast $$l_{1}$$-minimization algorithms for robust face recognition. IEEE Trans. Image Process. 22, 3234\u20133246 (2013)","journal-title":"IEEE Trans. Image Process."},{"key":"1257_CR40","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/140952363","volume":"37","author":"PH Yin","year":"2015","unstructured":"Yin, P.H., Lou, Y.F., He, Q., Xin, J.: Minimization of $$l_{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37, 536\u2013563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"7","key":"1257_CR41","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1016\/j.sigpro.2012.12.017","volume":"93","author":"J Zeng","year":"2013","unstructured":"Zeng, J., Xu, Z., Zhang, B., Hong, W., Wu, Y.: Accelerated $$l_{1\/2}$$ regularization based sar imaging via bcr and reduced newton skills. Signal Process. 93(7), 1831\u20131844 (2013)","journal-title":"Signal Process."},{"issue":"8","key":"1257_CR42","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1007\/s11432-012-4632-5","volume":"55","author":"JS Zeng","year":"2012","unstructured":"Zeng, J.S., Jian, F., Xu, Z.B.: Sparse sar imaging based on $$l_{1\/2}$$ regularization. Sci. China Inf. Sci. 55(8), 1755\u20131775 (2012)","journal-title":"Sci. China Inf. Sci."},{"issue":"9","key":"1257_CR43","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1109\/TSP.2014.2309076","volume":"62","author":"JS Zeng","year":"2014","unstructured":"Zeng, J.S., Lin, S.B., Wang, Y., Xu, Z.B.: $$l_{1\/2}$$ regularization: convergence of iterative half thresholding algorithm. IEEE Signal Process. 62(9), 2317\u20132329 (2014)","journal-title":"IEEE Signal Process."},{"key":"1257_CR44","doi-asserted-by":"publisher","first-page":"5106","DOI":"10.1109\/TSP.2016.2595499","volume":"64","author":"JS Zeng","year":"2014","unstructured":"Zeng, J.S., Lin, S.B., Xu, Z.B.: Sparse regularization: convergence of iterative jumping thresholding algorithm. IEEE Signal Process. 64, 5106\u20135118 (2014)","journal-title":"IEEE Signal Process."},{"key":"1257_CR45","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiaised variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01257-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01257-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01257-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T20:38:50Z","timestamp":1728506330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01257-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,2]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1257"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01257-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,12,2]]},"assertion":[{"value":"29 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}