{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:26:24Z","timestamp":1783110384990,"version":"3.54.6"},"reference-count":23,"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91538112"],"award-info":[{"award-number":["91538112"]}],"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.117850","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T05:27:37Z","timestamp":1780118857000},"page":"117850","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Compressed data separation via \u21131\u2212\u03b2\u2113q-split analysis"],"prefix":"10.1016","volume":"488","author":[{"given":"Yuhang","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117850_bib0001","series-title":"A Mathematical Introduction to Compressive Sensing","author":"Foucart","year":"2013"},{"issue":"1","key":"10.1016\/j.cam.2026.117850_bib0002","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.acha.2014.06.003","article-title":"Stable recovery of sparse signals via \u2113p-minimization","volume":"38","author":"Wen","year":"2015","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"10.1016\/j.cam.2026.117850_bib0003","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/j.acha.2017.10.004","article-title":"Optimal RIP bounds for sparse signals recovery via \u2113p minimization","volume":"47","author":"Zhang","year":"2019","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.cam.2026.117850_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2020.107695","article-title":"A new upper bound of p for \u2113p-minimization in compressed sensing","volume":"176","author":"Liang","year":"2020","journal-title":"Signal Process."},{"key":"10.1016\/j.cam.2026.117850_bib0005","first-page":"401","article-title":"A new greedy algorithm for sparse approximation","volume":"94","author":"Yang","year":"2014","journal-title":"Signal Process."},{"issue":"1","key":"10.1016\/j.cam.2026.117850_bib0006","doi-asserted-by":"crossref","first-page":"A536","DOI":"10.1137\/140952363","article-title":"Minimization of \u21131-\u21132 for compressed sensing","volume":"37","author":"Yin","year":"2015","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.cam.2026.117850_bib0007","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/ac39f8","article-title":"The Dantzig selector: recovery of signal via \u21131\u2212\u03b1\u21132 minimization","volume":"38","author":"Ge","year":"2021","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117850_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2022.108755","article-title":"Signal and image reconstruction with tight frames via unconstrained \u21131\u2212\u03b1\u21132-Analysis minimizations","volume":"203","author":"Li","year":"2023","journal-title":"Signal Process."},{"issue":"4","key":"10.1016\/j.cam.2026.117850_bib0009","doi-asserted-by":"crossref","first-page":"1886","DOI":"10.1137\/22M1525363","article-title":"\u21131\u2212\u03b2\u2113q Minimization for signal and image recovery","volume":"16","author":"Huo","year":"2023","journal-title":"SIAM J. Imaging Sci."},{"issue":"07","key":"10.1016\/j.cam.2026.117850_bib0010","doi-asserted-by":"crossref","DOI":"10.1142\/S1793557120501430","article-title":"Sparse recovery with general frame via general-dual-based analysis Dantzig selector","volume":"12","author":"Choe","year":"2019","journal-title":"Asian-Eur. J. Math."},{"issue":"1","key":"10.1016\/j.cam.2026.117850_bib0011","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.acha.2013.10.003","article-title":"Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO","volume":"37","author":"Lin","year":"2014","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"10.1016\/j.cam.2026.117850_bib0012","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1142\/S0219530522500130","article-title":"Compressed data separation via unconstrained \u21131-split analysis","volume":"21","author":"Gu","year":"2023","journal-title":"Anal. Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117850_bib0013","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.acha.2010.10.002","article-title":"Compressed sensing with coherent and redundant dictionaries","volume":"31","author":"Cand\u00e9s","year":"2011","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"8","key":"10.1016\/j.cam.2026.117850_bib0014","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","article-title":"Stable signal recovery from incomplete and inaccurate measurements","volume":"59","author":"Cand\u00e9s","year":"2006","journal-title":"Commun. Pure Appl. Math."},{"issue":"12","key":"10.1016\/j.cam.2026.117850_bib0015","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":"3","key":"10.1016\/j.cam.2026.117850_bib0016","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."},{"key":"10.1016\/j.cam.2026.117850_bib0017","series-title":"An Introduction to Frames and Riesz Bases","author":"Christensen","year":"2003"},{"issue":"06","key":"10.1016\/j.cam.2026.117850_bib0018","doi-asserted-by":"crossref","DOI":"10.1142\/S0219691318500583","article-title":"Sparse signal recovery via non-convex optimization and overcomplete dictionaries","volume":"16","author":"Huang","year":"2018","journal-title":"Int. J. Wavelets Multiresolution Inf. Process."},{"key":"10.1016\/j.cam.2026.117850_bib0019","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","article-title":"Global convergence of ADMM in nonconvex nonsmooth optimization","volume":"78","author":"Wang","year":"2019","journal-title":"J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117850_bib0020","series-title":"First-Order Methods in Optimization","author":"Beck","year":"2017"},{"issue":"7","key":"10.1016\/j.cam.2026.117850_bib0021","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","article-title":"L1\/2 regularization: a thresholding representation theory and a fast solver","volume":"23","author":"Xu","year":"2012","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"10","key":"10.1016\/j.cam.2026.117850_bib0022","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIP.2005.852206","article-title":"Image decomposition via the combination of sparse representation and a variational approach","volume":"14","author":"Starck","year":"2005","journal-title":"IEEE Trans. Image Process."},{"issue":"10","key":"10.1016\/j.cam.2026.117850_bib0023","article-title":"A projected gradient method for \u03b1\u21131\u2212\u03b2\u21132 sparsity regularization","volume":"36","author":"Ding","year":"2020","journal-title":"Inverse Probl."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004929?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004929?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:03:57Z","timestamp":1783109037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":23,"alternative-id":["S0377042726004929"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117850","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":"Compressed data separation via -split analysis","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.117850","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":"117850"}}