{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:53:06Z","timestamp":1773809586856,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:00:00Z","timestamp":1666396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:00:00Z","timestamp":1666396800000},"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":["11861020"],"award-info":[{"award-number":["11861020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10589-022-00419-2","type":"journal-article","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T18:03:18Z","timestamp":1666461798000},"page":"801-844","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Solving constrained nonsmooth group sparse optimization via group Capped-$$\\ell _1$$ relaxation and group smoothing proximal gradient algorithm"],"prefix":"10.1007","volume":"83","author":[{"given":"Xian","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5632-3050","authenticated-orcid":false,"given":"Dingtao","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,22]]},"reference":[{"key":"419_CR1","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn, M., Pang, J.-S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Opt. 27, 1637\u20131665 (2017)","journal-title":"SIAM J. Opt."},{"issue":"1\u20132","key":"419_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-018-1277-1","volume":"178","author":"A Bech","year":"2019","unstructured":"Bech, A., Hallak, N.: Optimization problems involving group sparsity terms. Math. Prog. 178(1\u20132), 39\u201367 (2019)","journal-title":"Math. Prog."},{"issue":"1","key":"419_CR3","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"key":"419_CR4","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1287\/moor.2016.0837","volume":"42","author":"W Bian","year":"2017","unstructured":"Bian, W., Chen, X.: Optimality and complexity for constrained optimization problems with nonconvex regularization. Math. Oper. Res. 42, 1063\u20131084 (2017)","journal-title":"Math. Oper. Res."},{"key":"419_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11222-013-9424-2","volume":"25","author":"P Breheny","year":"2015","unstructured":"Breheny, P., Huang, J.: Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors. Stat. Comput. 25, 173\u2013187 (2015)","journal-title":"Stat. Comput."},{"key":"419_CR6","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 $$\\ell _{2}$$-$$\\ell _{p}$$ minimization. SIAM J. Sci. Comput. 32, 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"419_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)"},{"key":"419_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.acha.2015.11.006","volume":"43","author":"AM Eren","year":"2017","unstructured":"Eren, A.M., Vidyasagar, M.: Error bounds for compressed sensing algorithms with group sparsity: a unified approach. Appl. Comput. Harmon. Anal. 43, 212\u2013232 (2017)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"419_CR9","first-page":"890","volume":"31","author":"VDB Ewout","year":"2008","unstructured":"Ewout, V.D.B., Friedlander, M.: Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"419_CR10","first-page":"595","volume":"3","author":"J Fan","year":"2006","unstructured":"Fan, J., Li, R.: Statistical challenges with high dimensionality: feature selection in knowledge discovery. Proc. Int. Cong. Math. 3, 595\u2013622 (2006)","journal-title":"Proc. Int. Cong. Math."},{"key":"419_CR11","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. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"419_CR12","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1214\/009053604000000256","volume":"32","author":"J Fan","year":"2004","unstructured":"Fan, J., Peng, H.: Nonconcave penalized likelihood with a diverging number of parameters. Ann. Stat. 32, 928\u2013961 (2004)","journal-title":"Ann. Stat."},{"key":"419_CR13","unstructured":"Gong, P., Zhang, C., Lu, Z.: A general iterative shrinkage and thresholding algorithm for nonconvex regularized optimization problems. In: Proceedings of the 30th International Conference on Machine Learning, 28, 37\u201345 (2013)"},{"key":"419_CR14","doi-asserted-by":"crossref","unstructured":"Gramfort, A., Kowalski, M.: Improving M\/EEG source localization with an inter-condition sparse prior. In: IEEE International Symposium on Biomedical Imaging(ISBI) (2009)","DOI":"10.1109\/ISBI.2009.5193003"},{"key":"419_CR15","first-page":"1","volume":"18","author":"Y Hu","year":"2017","unstructured":"Hu, Y., Li, C., Meng, K., Qin, J., Yang, X.: Group sparse optimization via $$L_{p, q}$$ regularization. J. Mach. Learn. Res. 18, 1\u201352 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"419_CR16","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1214\/12-STS392","volume":"27","author":"J Huang","year":"2012","unstructured":"Huang, J., Breheny, P., Ma, S.: A selective review of group selection in high-dimensional models. Stat. Sci. 27(4), 481\u2013499 (2012)","journal-title":"Stat. Sci."},{"key":"419_CR17","doi-asserted-by":"publisher","first-page":"1978","DOI":"10.1214\/09-AOS778","volume":"38","author":"J Huang","year":"2010","unstructured":"Huang, J., Zhang, T.: The benefit of group sparsity. Ann. Stat. 38, 1978\u20132004 (2010)","journal-title":"Ann. Stat."},{"issue":"4","key":"419_CR18","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1109\/TSP.2016.2630028","volume":"65","author":"Y Jiao","year":"2017","unstructured":"Jiao, Y., Jin, B., Lv, X.: Group sparse recovery via the $$\\ell _{0}(l_{2})$$ penalty: theory and algorithm. IEEE Trans. Signal Process. 65(4), 998\u20131012 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"419_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"THA Le","year":"2015","unstructured":"Le, T.H.A., Pham, D.T., Le, H.-M., Vo, X.-T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244, 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"419_CR20","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/00949655.2015.1026822","volume":"86","author":"S Lee","year":"2016","unstructured":"Lee, S., Oh, M., Kim, Y.: Sparse optimization for nonconvex group penalized estimation. J. Stat. Comput. Simul. 86, 597\u2013610 (2016)","journal-title":"J. Stat. Comput. Simul."},{"key":"419_CR21","doi-asserted-by":"crossref","unstructured":"Li W., Bian W., Toh K.-C.: DC algorithms for a class of sparse group $$\\ell _0$$ regularized optimization problems. arXiv:2109.05251 (2021)","DOI":"10.1137\/21M1443455"},{"issue":"1\u20132","key":"419_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-017-1114-y","volume":"166","author":"H Liu","year":"2017","unstructured":"Liu, H., Yao, T., Li, R., Ye, Y.: Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Math. Prog. 166(1\u20132), 207\u2013240 (2017)","journal-title":"Math. Prog."},{"key":"419_CR23","doi-asserted-by":"crossref","unstructured":"Meier, L., van, de. Geer. S., Buhlmann, P.: The group Lasso for logistic regression. J. R. Stat. Soc. Ser. B 70, 53\u201371 (2008)","DOI":"10.1111\/j.1467-9868.2007.00627.x"},{"key":"419_CR24","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, 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"419_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"L Pan","year":"2021","unstructured":"Pan, L., Chen, X.: Group sparse optimization for images recovery using capped folded concave functions. SIAM J. Imag. Sci. 14(1), 1\u201325 (2021)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"419_CR26","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"J-S Pang","year":"2017","unstructured":"Pang, J.-S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"419_CR27","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1080\/10556788.2019.1684492","volume":"35","author":"D Peng","year":"2020","unstructured":"Peng, D., Chen, X.: Computation of second-order directional stationary points for group sparse optimization. Opt. Methods Softw. 35(2), 348\u2013376 (2020)","journal-title":"Opt. Methods Softw."},{"key":"419_CR28","unstructured":"Rockafellar, R.: Convex analysis. Princeton University Press, Princeton (1970)"},{"key":"419_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R Rockafellar","year":"1998","unstructured":"Rockafellar, R., Wets, R.-J.: Variational Analysis. Springer, Berlin (1998)"},{"key":"419_CR30","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/151003714","volume":"8","author":"E Soubies","year":"2015","unstructured":"Soubies, E., Blanc-F\u00e9rand, L., Aubert, G.: A continuous exact $$L_{0}$$ penalty (CE$$L_{0}$$) for least squares regularized problem. SIAM J. Imag. Sci. 8, 1607\u20131639 (2015)","journal-title":"SIAM J. Imag. Sci."},{"key":"419_CR31","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1137\/16M1059333","volume":"27","author":"E Soubies","year":"2017","unstructured":"Soubies, E., Blanc-F\u00e9rand, L., Aubert, G.: A unified view of exact continuous penalties for $$\\ell _{2}$$-$$\\ell _{0}$$ minimization. SIAM J. Opt. 27, 2034\u20132060 (2017)","journal-title":"SIAM J. Opt."},{"key":"419_CR32","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.csda.2011.08.007","volume":"56","author":"F Wei","year":"2012","unstructured":"Wei, F., Zhu, H.: Group coordinate descent algorithms for nonconvex penalized regression. Comput. Stat. Data Anal. 56, 316\u2013326 (2012)","journal-title":"Comput. Stat. Data Anal."},{"issue":"1","key":"419_CR33","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"419_CR34","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1214\/07-AOS520","volume":"36","author":"C-H Zhang","year":"2008","unstructured":"Zhang, C.-H., Huan, J.: The sparsity and bias of the LASSO selection in high dimensional linear regression. Ann. Stat. 36, 1567\u20131594 (2008)","journal-title":"Ann. Stat."},{"key":"419_CR35","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"419_CR36","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11, 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00419-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00419-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00419-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T11:20:26Z","timestamp":1669202426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00419-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,22]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["419"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00419-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,22]]},"assertion":[{"value":"25 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2022","order":3,"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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}