{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T13:21:33Z","timestamp":1783171293232,"version":"3.54.6"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100009019","name":"Shenzhen University","doi-asserted-by":"publisher","award":["2023QNT011"],"award-info":[{"award-number":["2023QNT011"]}],"id":[{"id":"10.13039\/501100009019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010226","name":"Department of Education of Guangdong Province","doi-asserted-by":"publisher","award":["2023ZDZX1017"],"award-info":[{"award-number":["2023ZDZX1017"]}],"id":[{"id":"10.13039\/501100010226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010226","name":"Department of Education of Guangdong Province","doi-asserted-by":"publisher","award":["2025ZDZX2059"],"award-info":[{"award-number":["2025ZDZX2059"]}],"id":[{"id":"10.13039\/501100010226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2026A1515011959"],"award-info":[{"award-number":["2026A1515011959"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2025A1515011723"],"award-info":[{"award-number":["2025A1515011723"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2025YFA1016903"],"award-info":[{"award-number":["2025YFA1016903"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["JCYJ20241202124209011"],"award-info":[{"award-number":["JCYJ20241202124209011"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["RCJC20221008092753082"],"award-info":[{"award-number":["RCJC20221008092753082"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["RCYX20231211090222026"],"award-info":[{"award-number":["RCYX20231211090222026"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12426311"],"award-info":[{"award-number":["12426311"]}],"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":["12571327"],"award-info":[{"award-number":["12571327"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.cam.2026.117816","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T15:03:48Z","timestamp":1779807828000},"page":"117816","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimal group thresholding algorithms for group sparse optimization with convergence guarantee"],"prefix":"10.1016","volume":"488","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6412-5804","authenticated-orcid":false,"given":"Yaohua","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingchao","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Fan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chezhou","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cam.2026.117816_bib0001","first-page":"1","article-title":"Optimization with sparsity-inducing penalties","volume":"4","author":"Bach","year":"2012","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"10.1016\/j.cam.2026.117816_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/19M1304799","article-title":"Group sparse optimization for images recovery using capped folded concave functions","volume":"14","author":"Pan","year":"2021","journal-title":"SIAM J. Imaging Sci."},{"issue":"6","key":"10.1016\/j.cam.2026.117816_bib0003","doi-asserted-by":"crossref","DOI":"10.1093\/bib\/bbab311","article-title":"Cell fate conversion prediction by group sparse optimization method utilizing single-cell and bulk OMICs data","volume":"22","author":"Qin","year":"2021","journal-title":"Brief. Bioinform."},{"issue":"5","key":"10.1016\/j.cam.2026.117816_bib0004","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","article-title":"Iterative thresholding for sparse approximations","volume":"14","author":"Blumensath","year":"2008","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"10.1016\/j.cam.2026.117816_bib0005","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","article-title":"Normalized iterative hard thresholding: guaranteed stability and performance","volume":"4","author":"Blumensath","year":"2010","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"6","key":"10.1016\/j.cam.2026.117816_bib0006","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1137\/100806278","article-title":"Hard thresholding pursuit: an algorithm for compressive sensing","volume":"49","author":"Foucart","year":"2011","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"10.1016\/j.cam.2026.117816_bib0007","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/18M1219187","article-title":"Optimal k-thresholding algorithms for sparse optimization problems","volume":"30","author":"Zhao","year":"2020","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.cam.2026.117816_bib0008","doi-asserted-by":"crossref","first-page":"A246","DOI":"10.1137\/17M1155983","article-title":"Joint sparse recovery based on variances","volume":"41","author":"Adcock","year":"2019","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117816_bib0009","first-page":"467","article-title":"Sparse broadband beamformer design via proximal optimization techniques","volume":"7","author":"Chen","year":"2023","journal-title":"J. Nonlinear Var. Anal."},{"issue":"9","key":"10.1016\/j.cam.2026.117816_bib0010","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/ad617d","article-title":"Joint sparse optimization: lower-order regularization method and application in cell fate conversion","volume":"40","author":"Hu","year":"2024","journal-title":"Inverse Probl."},{"issue":"30","key":"10.1016\/j.cam.2026.117816_bib0011","first-page":"1","article-title":"Group sparse optimization via \u2113(p,q) regularization","volume":"18","author":"Hu","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.cam.2026.117816_bib0012","first-page":"953","article-title":"Sparse least squares K-SVCR multi-class classification","volume":"8","author":"Moosaei","year":"2024","journal-title":"J. Nonlinear Var. Anal."},{"issue":"7","key":"10.1016\/j.cam.2026.117816_bib0013","doi-asserted-by":"crossref","first-page":"1694","DOI":"10.1109\/TSP.2014.2301980","article-title":"Greedy algorithms for joint sparse recovery","volume":"62","author":"Blanchard","year":"2014","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"10.1016\/j.cam.2026.117816_bib0014","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1137\/0606668909","article-title":"Recovery algorithms for vector-valued data with joint sparsity constraints","volume":"46","author":"Fornasier","year":"2008","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"10.1016\/j.cam.2026.117816_bib0015","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10915-024-02682-3","article-title":"Constrained mix sparse optimization via hard thresholding pursuit","volume":"101","author":"Hu","year":"2024","journal-title":"J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117816_bib0016","first-page":"1516","article-title":"Structured sparse regression via greedy hard thresholding","volume":"29","author":"Jain","year":"2016","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"12","key":"10.1016\/j.cam.2026.117816_bib0017","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Cand\u00e9s","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.cam.2026.117816_bib0018","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10107-024-02068-1","article-title":"On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization","volume":"211","author":"Hu","year":"2025","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cam.2026.117816_bib0019","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1137\/120869997","article-title":"A proximal-gradient homotopy method for the sparse least-squares problem","volume":"23","author":"Xiao","year":"2013","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.cam.2026.117816_bib0020","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/090748160","article-title":"Compressed sensing: how sharp is the restricted isometry property?","volume":"53","author":"Blanchard","year":"2011","journal-title":"SIAM Rev."},{"issue":"4","key":"10.1016\/j.cam.2026.117816_bib0021","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1109\/TIT.2010.2040894","article-title":"Model-based compressive sensing","volume":"56","author":"Baraniuk","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.cam.2026.117816_bib0022","doi-asserted-by":"crossref","first-page":"5302","DOI":"10.1109\/TIT.2009.2030471","article-title":"Robust recovery of signals from a structured union of subspaces","volume":"55","author":"Eldar","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.cam.2026.117816_bib0023","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.acha.2022.03.007","article-title":"The restricted isometry property of block diagonal matrices for group-sparse signal recovery","volume":"60","author":"Koep","year":"2022","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"10.1016\/j.cam.2026.117816_bib0024","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TSP.2012.2226171","article-title":"New bounds for restricted isometry constants with coherent tight frames","volume":"61","author":"Lin","year":"2013","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"10.1016\/j.cam.2026.117816_bib0025","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1287\/ijoc.2017.0789","article-title":"Quadratic combinatorial optimization using separable underestimators","volume":"30","author":"Buchheim","year":"2018","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cam.2026.117816_bib0026","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/140978077","article-title":"Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method","volume":"26","author":"Burdakov","year":"2016","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T12:57:33Z","timestamp":1783169853000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":26,"alternative-id":["S0377042726004589"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117816","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal group thresholding algorithms for group sparse optimization with convergence guarantee","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117816","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117816"}}