{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:04:01Z","timestamp":1781298241748,"version":"3.54.1"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Digital Signal Processing"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dsp.2026.106330","type":"journal-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:01:00Z","timestamp":1780963260000},"page":"106330","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Nonnegative sparse approximation: Algorithms, learning, and distributions"],"prefix":"10.1016","volume":"182","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0028-3023","authenticated-orcid":false,"given":"Nicholas","family":"Schachter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dsp.2026.106330_bib0001","doi-asserted-by":"crossref","DOI":"10.1007\/BF02678430","article-title":"Adaptive greedy approximations","volume":"13","author":"Davis","year":"1997","journal-title":"Constr. Approx"},{"key":"10.1016\/j.dsp.2026.106330_bib0002","article-title":"Hardness of approximation for sparse optimization with L0 norm","author":"Chen","year":"2016","journal-title":"Tech. Rep."},{"key":"10.1016\/j.dsp.2026.106330_bib0003","series-title":"NP-hardness of L0 minimization problems: revision and extension to the non-negative setting","author":"Nguyen","year":"2019"},{"issue":"38","key":"10.1016\/j.dsp.2026.106330_bib0004","first-page":"1","article-title":"Approximation hardness for a class of sparse optimization problems","volume":"20","author":"Chen","year":"2019","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10.1016\/j.dsp.2026.106330_bib0005","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","article-title":"Sparsity and smoothness via the fused lasso","volume":"67","author":"Tibshirani","year":"2005","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"issue":"2","key":"10.1016\/j.dsp.2026.106330_bib0006","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","article-title":"Regularization and variable selection via the elastic net","volume":"67","author":"Zou","year":"2005","journal-title":"J. R. Stat. Soc.: B"},{"issue":"10","key":"10.1016\/j.dsp.2026.106330_bib0007","doi-asserted-by":"crossref","first-page":"4595","DOI":"10.1109\/TSP.2011.2161292","article-title":"The in-crowd algorithm for fast basis pursuit denoising","volume":"59","author":"Gill","year":"2011","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"10.1016\/j.dsp.2026.106330_bib0008","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","article-title":"Signal recovery by proximal forward-backward splitting","volume":"4","author":"Combettes","year":"2005","journal-title":"Multiscale Model. Simul."},{"key":"10.1016\/j.dsp.2026.106330_bib0009","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/OJSP.2024.3360914","article-title":"Correlated sparse Bayesian learning for recovery of block sparse signals with unknown borders","volume":"5","author":"Dogan","year":"2024","journal-title":"IEEE Open J. Signal Process."},{"key":"10.1016\/j.dsp.2026.106330_bib0010","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TSP.2014.2375133","article-title":"Pattern-coupled sparse bayesian learning for recovery of block-sparse signals","volume":"63","author":"Fang","year":"2013","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.dsp.2026.106330_bib0011","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via 1 minimization","volume":"100","author":"Donoho","year":"2003","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.dsp.2026.106330_bib0012","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","article-title":"Greed is good: algorithmic results for sparse approximation","volume":"50","author":"Tropp","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.dsp.2026.106330_bib0013","doi-asserted-by":"crossref","first-page":"4813","DOI":"10.1109\/TIT.2008.929920","article-title":"On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations","volume":"54","author":"Bruckstein","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.dsp.2026.106330_bib0014","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/LSP.2014.2307064","article-title":"Sparse recovery by means of nonnegative least squares","volume":"21","author":"Foucart","year":"2014","journal-title":"Signal Process. Lett. IEEE"},{"issue":"12","key":"10.1016\/j.dsp.2026.106330_bib0015","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.dsp.2026.106330_bib0016","doi-asserted-by":"crossref","unstructured":"D. Bertsimas, A. King, R. Mazumder, Best subset selection via a modern optimization lens, 2015. arXiv: 1507.03133 [stat.ME].","DOI":"10.1214\/15-AOS1388"},{"key":"10.1016\/j.dsp.2026.106330_bib0017","doi-asserted-by":"crossref","unstructured":"H. Hazimeh, R. Mazumder, Fast best subset selection: coordinate descent and local combinatorial optimization algorithms, 2020. arXiv: 1803.01454 [stat.CO].","DOI":"10.1287\/opre.2019.1919"},{"key":"10.1016\/j.dsp.2026.106330_bib0018","unstructured":"K. Behdin, W. Chen, R. Mazumder, Sparse Gaussian graphical models with discrete optimization: computational and statistical perspectives, 2023. arXiv: 2307.09366 [cs.LG]."},{"key":"10.1016\/j.dsp.2026.106330_bib0019","first-page":"1","article-title":"Sparse regression at scale: branch-and-bound rooted in first-order optimization","volume":"196","author":"Hazimeh","year":"2021","journal-title":"Math. Program."},{"key":"10.1016\/j.dsp.2026.106330_bib0020","unstructured":"C. Elvira, T. Guyard, C. Herzet, A generic branch-and-bound algorithm for \u21130-penalized problems with supplementary material(2025). arXiv: 2506.03974."},{"key":"10.1016\/j.dsp.2026.106330_bib0021","series-title":"Exact sparse nonnegative least squares","first-page":"5395","author":"Nadisic","year":"2020"},{"key":"10.1016\/j.dsp.2026.106330_bib0022","series-title":"Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing","first-page":"302","article-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/j.dsp.2026.106330_bib0023","series-title":"Doklady Akademii Nauk","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachiyan","year":"1979"},{"key":"10.1016\/j.dsp.2026.106330_bib0024","series-title":"Provable Intractability: The Class X P","first-page":"341","author":"Downey","year":"1999"},{"key":"10.1016\/j.dsp.2026.106330_bib0025","series-title":"Parameterized Complexity Theory","author":"Flum","year":"2006"},{"key":"10.1016\/j.dsp.2026.106330_bib0026","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","article-title":"Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Log."},{"issue":"1","key":"10.1016\/j.dsp.2026.106330_bib0027","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0215020","article-title":"Average case complete problems","volume":"15","author":"Levin","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dsp.2026.106330_bib0028","article-title":"Notes on Levin\u2019s theory of average-case complexity","volume":"TR97-058","author":"Goldreich","year":"1997","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"10.1016\/j.dsp.2026.106330_bib0029","series-title":"Parameterized Randomization","author":"Muller","year":"2008"},{"key":"10.1016\/j.dsp.2026.106330_bib0030","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2015.01.042","article-title":"On the average-case complexity of parameterized clique","volume":"576","author":"Fountoulakis","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.dsp.2026.106330_bib0031","article-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/j.dsp.2026.106330_bib0032","series-title":"Continuous Multivariate Distributions, Models and Applications: Second Edition","author":"Kotz","year":"2005"},{"key":"10.1016\/j.dsp.2026.106330_bib0033","series-title":"High-Dimensional Statistics: A Non-Asymptotic Viewpoint","author":"Wainwright","year":"2019"},{"key":"10.1016\/j.dsp.2026.106330_bib0034","series-title":"Non-Uniform Random Variate Generation","author":"Devroye","year":"1986"},{"key":"10.1016\/j.dsp.2026.106330_bib0035","series-title":"Theory of Point Estimation","author":"Lehmann","year":"1998"}],"container-title":["Digital Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1051200426004483?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1051200426004483?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:39:51Z","timestamp":1781296791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1051200426004483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":35,"alternative-id":["S1051200426004483"],"URL":"https:\/\/doi.org\/10.1016\/j.dsp.2026.106330","relation":{},"ISSN":["1051-2004"],"issn-type":[{"value":"1051-2004","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Nonnegative sparse approximation: Algorithms, learning, and distributions","name":"articletitle","label":"Article Title"},{"value":"Digital Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dsp.2026.106330","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106330"}}