{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:33:18Z","timestamp":1777127598068,"version":"3.51.4"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"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":["62371174"],"award-info":[{"award-number":["62371174"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.sigpro.2026.110612","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T18:02:08Z","timestamp":1774461728000},"page":"110612","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient demixing of multiplex graph signals: A Convex-Concave optimization approach"],"prefix":"10.1016","volume":"246","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8419-7355","authenticated-orcid":false,"given":"Yunhang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4642-8777","authenticated-orcid":false,"given":"Zhaoting","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5255-8053","authenticated-orcid":false,"given":"Ran","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8294-9426","authenticated-orcid":false,"given":"Ying","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.sigpro.2026.110612_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109827","article-title":"Distributed online constrained nonconvex optimization in dynamic environments over directed graphs","volume":"230","author":"Suo","year":"2025","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110612_bib0002","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109864","article-title":"Blind deconvolution on graphs: exact and stable recovery","volume":"230","author":"Ye","year":"2025","journal-title":"Signal Process."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110612_bib0003","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1109\/JPROC.2018.2820126","article-title":"Graph signal processing: overview, challenges, and applications","volume":"106","author":"Ortega","year":"2018","journal-title":"Proc. IEEE"},{"issue":"1","key":"10.1016\/j.sigpro.2026.110612_bib0004","doi-asserted-by":"crossref","first-page":"153","DOI":"10.23919\/cje.2022.00.272","article-title":"Graph signal reconstruction from low-Resolution multi-Bit observations","volume":"33","author":"Liu","year":"2024","journal-title":"Chinese J. Electron."},{"key":"10.1016\/j.sigpro.2026.110612_bib0005","doi-asserted-by":"crossref","first-page":"2585","DOI":"10.1109\/TSP.2021.3073226","article-title":"Graph signal processing meets blind source separation","volume":"69","author":"Miettinen","year":"2021","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110612_bib0006","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1109\/TSP.2024.3361712","article-title":"A new approach for graph signal separation based on smoothness","volume":"72","author":"Yarandi","year":"2024","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110612_bib0007","first-page":"543","article-title":"A unified approach for simultaneous graph learning and blind separation of graph signal sources","volume":"8","author":"Einizade","year":"2022","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"key":"10.1016\/j.sigpro.2026.110612_bib0008","first-page":"152","article-title":"Graph signal separation based on smoothness or sparsity in the frequency domain","volume":"9","author":"Mohammadi","year":"2023","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"key":"10.1016\/j.sigpro.2026.110612_bib0009","first-page":"823","article-title":"A closed-Form solution for graph signal separation based on smoothness","volume":"9","author":"Yarandi","year":"2023","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"key":"10.1016\/j.sigpro.2026.110612_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109483","article-title":"Tensor decomposition meets blind source separation","volume":"221","author":"Le","year":"2024","journal-title":"Signal Process."},{"issue":"7","key":"10.1016\/j.sigpro.2026.110612_bib0011","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1109\/TSP.2004.828896","article-title":"Blind separation of speech mixtures via time-frequency masking","volume":"52","author":"Yilmaz","year":"2004","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110612_bib0012","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1109\/LWC.2024.3384813","article-title":"Single-Channel blind source separation in wireless communications: a complex-Domain deep learning approach","volume":"13","author":"Guo","year":"2024","journal-title":"IEEE Wireless Commun. Lett."},{"issue":"12","key":"10.1016\/j.sigpro.2026.110612_bib0013","doi-asserted-by":"crossref","first-page":"2525","DOI":"10.1109\/TBME.2006.883796","article-title":"On semi-Blind source separation using spatial constraints with applications in EEG analysis","volume":"53","author":"Hesse","year":"2006","journal-title":"IEEE Trans. Biomed. Eng."},{"key":"10.1016\/j.sigpro.2026.110612_bib0014","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109487","article-title":"Separation of overlapping audio signals: a review on current trends and evolving approaches","volume":"221","author":"Nath","year":"2024","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110612_bib0015","first-page":"35","article-title":"Joint graph learning and blind separation of smooth graph signals using minimization of mutual information and laplacian quadratic forms","volume":"9","author":"Einizade","year":"2023","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"issue":"19","key":"10.1016\/j.sigpro.2026.110612_bib0016","doi-asserted-by":"crossref","first-page":"5149","DOI":"10.1109\/TSP.2015.2449255","article-title":"A saddle point algorithm for networked online convex optimization","volume":"63","author":"Koppel","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110612_bib0017","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1007\/s10957-024-02436-z","article-title":"Robust bond portfolio construction via convex-concave saddle point optimization","volume":"201","author":"Luxenberg","year":"2024","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.sigpro.2026.110612_bib0018","first-page":"1","article-title":"Mutual incoherence and relative total variation regularizations for blind hyperspectral unmixing","volume":"62","author":"Song","year":"2024","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"10.1016\/j.sigpro.2026.110612_bib0019","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1109\/TSP.2023.3343560","article-title":"Manifold graph signal restoration using gradient graph laplacian regularizer","volume":"72","author":"Chen","year":"2024","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110612_bib0020","first-page":"1","article-title":"Superpixel-Based graph laplacian regularization for sparse hyperspectral unmixing","volume":"19","author":"Ince","year":"2022","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"issue":"7","key":"10.1016\/j.sigpro.2026.110612_bib0021","first-page":"3450","article-title":"Fast and robust iterative closest point","volume":"44","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110612_bib0022","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1137\/130919398","article-title":"Convergence analysis for anderson acceleration","volume":"53","author":"Toth","year":"2015","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110612_bib0023","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1109\/LAWP.2022.3216381","article-title":"An integral equation-based overlapping domain decomposition method enhanced with anderson acceleration","volume":"22","author":"Zhu","year":"2023","journal-title":"IEEE Antennas Wirel. Propag. Lett."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110612_bib0024","doi-asserted-by":"crossref","first-page":"2585","DOI":"10.1109\/TAP.2025.3528749","article-title":"An anderson acceleration inspired VBIM for solving the electromagnetic inverse scattering problems","volume":"73","author":"Zhou","year":"2025","journal-title":"IEEE Trans. Antennas. Propag."},{"key":"10.1016\/j.sigpro.2026.110612_bib0025","doi-asserted-by":"crossref","first-page":"3502","DOI":"10.1109\/TSP.2023.3315454","article-title":"A proximal-Proximal majorization-Minimization algorithm for nonconvex rank regression problems","volume":"71","author":"Tang","year":"2023","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110612_bib0026","first-page":"375","article-title":"Proximal splitting algorithms for convex optimization: a tour of recent advances, with new twists","volume":"65","author":"Condat","year":"2023","journal-title":"SIAM Rev. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.sigpro.2026.110612_bib0027","series-title":"Functional analysis","author":"van Neerven","year":"2022"}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016516842600126X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016516842600126X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T13:33:12Z","timestamp":1777123992000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016516842600126X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":27,"alternative-id":["S016516842600126X"],"URL":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110612","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient demixing of multiplex graph signals: A Convex-Concave optimization approach","name":"articletitle","label":"Article Title"},{"value":"Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110612","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":"110612"}}