{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:38:46Z","timestamp":1772728726183,"version":"3.50.1"},"reference-count":67,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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":["Signal Processing"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.sigpro.2026.110531","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T07:42:59Z","timestamp":1770104579000},"page":"110531","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Pseudo-inverse-based hard thresholding pursuit algorithm with momentum: An innovative second-order method for sparse signal recovery"],"prefix":"10.1016","volume":"244","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2636-5642","authenticated-orcid":false,"given":"Wen","family":"Jin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0482-1650","authenticated-orcid":false,"given":"Lie-Jun","family":"Xie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/j.sigpro.2026.110531_bib0001","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Cand\u00e8s","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.sigpro.2026.110531_bib0002","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.sigpro.2026.110531_bib0003","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Cand\u00e8s","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.sigpro.2026.110531_bib0004","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1109\/PROC.1977.10771","article-title":"The Shannon sampling theorem - its various extensions and applications: a tutorial review","volume":"65","author":"Jerri","year":"1977","journal-title":"Proc. IEEE"},{"issue":"6","key":"10.1016\/j.sigpro.2026.110531_bib0005","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1002\/mrm.21391","article-title":"Sparse MRI: the application of compressed sensing for rapid MR imaging","volume":"58","author":"Lustig","year":"2007","journal-title":"Magn. Reson. Med."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110531_bib0006","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MSP.2007.914728","article-title":"Compressed sensing MRI","volume":"25","author":"Lustig","year":"2008","journal-title":"IEEE Signal Process. Mag."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110531_bib0007","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/TMI.2010.2085084","article-title":"Compressed-sensing MRI with random encoding","volume":"30","author":"Haldar","year":"2011","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"3","key":"10.1016\/j.sigpro.2026.110531_bib0008","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MSP.2018.2789521","article-title":"Sparse representation for wireless communications: a compressive sensing approach","volume":"35","author":"Qin","year":"2018","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110531_bib0009","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TNNLS.2012.2226471","article-title":"Two-stage nonnegative sparse representation for large-scale face recognition","volume":"24","author":"He","year":"2013","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.sigpro.2026.110531_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2023.109260","article-title":"A ReLU-based hard-thresholding algorithm for non-negative sparse signal recovery","volume":"215","author":"He","year":"2024","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110531_bib0011","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","article-title":"Sparse approximate solutions to linear systems","volume":"24","author":"Natarajan","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.sigpro.2026.110531_bib0012","series-title":"Proc. IEEE Int. Conf. Acoust. Speech Signal Process.","first-page":"3869","article-title":"Iteratively reweighted algorithms for compressive sensing","author":"Chartrand","year":"2008"},{"issue":"4","key":"10.1016\/j.sigpro.2026.110531_bib0013","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1137\/13090540X","article-title":"A method for finding structured sparse solutions to non-negative least squares problems with applications","volume":"6","author":"Esser","year":"2013","journal-title":"SIAM J. Imag. Sci."},{"key":"10.1016\/j.sigpro.2026.110531_bib0014","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","article-title":"Enhancing sparsity by reweighted \u21131 minimization","volume":"14","author":"Cand\u00e8s","year":"2008","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110531_bib0015","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1137\/110847445","article-title":"Reweighted \u21131-Minimization for sparse solutions to underdetermined linear systems","volume":"22","author":"Zhao","year":"2012","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.sigpro.2026.110531_sbref0016","first-page":"211","article-title":"Sparse Bayesian learning and the relevance vector machine","volume":"1","author":"Tipping","year":"2001","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.sigpro.2026.110531_bib0017","series-title":"Proc. IEEE Int. Conf. Acoust. Speech Signal Process.","first-page":"3169","article-title":"Decoding real-field codes by an iterative expectation-maximization (EM) algorithm","author":"Zayyani","year":"2008"},{"issue":"6","key":"10.1016\/j.sigpro.2026.110531_bib0018","doi-asserted-by":"crossref","first-page":"2346","DOI":"10.1109\/TSP.2007.914345","article-title":"Bayesian compressive sensing","volume":"56","author":"Ji","year":"2008","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110531_bib0019","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10898-022-01143-1","article-title":"Partial gradient optimal thresholding algorithms for a class of sparse optimization problems","volume":"84","author":"Meng","year":"2022","journal-title":"J. Global Optim."},{"issue":"7","key":"10.1016\/j.sigpro.2026.110531_bib0020","doi-asserted-by":"crossref","first-page":"7621","DOI":"10.1109\/TITS.2022.3172868","article-title":"A pseudo-inverse-based hard thresholding algorithm for sparse signal recovery","volume":"24","author":"Wen","year":"2023","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.sigpro.2026.110531_bib0021","doi-asserted-by":"crossref","first-page":"1346","DOI":"10.1109\/LSP.2025.3550768","article-title":"Momentum-based iterative hard thresholding algorithm for sparse signal recovery","volume":"32","author":"Jin","year":"2025","journal-title":"IEEE Signal Process. Lett."},{"key":"10.1016\/j.sigpro.2026.110531_bib0022","series-title":"Proc. the 27th Asilomar Conf. Signals Syst. and Comput.","first-page":"40","article-title":"Orthogonal matching pursuits: recursive function approximation with applications to wavelet decomposition","author":"Pati","year":"1993"},{"issue":"3","key":"10.1016\/j.sigpro.2026.110531_bib0023","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","article-title":"CoSaMP: iterative signal recovery from incomplete and inaccurate samples","volume":"26","author":"Needell","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110531_bib0024","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","article-title":"Subspace pursuit for compressive sensing signal reconstruction","volume":"55","author":"Dai","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.sigpro.2026.110531_bib0025","doi-asserted-by":"crossref","first-page":"4685","DOI":"10.1109\/TSP.2006.882080","article-title":"Tree-based pursuit: algorithm and properties","volume":"54","author":"Jost","year":"2006","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"10.1016\/j.sigpro.2026.110531_bib0026","doi-asserted-by":"crossref","first-page":"4333","DOI":"10.1109\/TSP.2009.2025088","article-title":"Stagewise weak gradient pursuits","volume":"57","author":"Blumensath","year":"2009","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110531_bib0027","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","article-title":"Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit","volume":"58","author":"Donoho","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.sigpro.2026.110531_bib0028","doi-asserted-by":"crossref","first-page":"6202","DOI":"10.1109\/TSP.2012.2218810","article-title":"Generalized orthogonal matching pursuit","volume":"60","author":"Wang","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110531_bib0029","doi-asserted-by":"crossref","first-page":"2986","DOI":"10.1109\/TIT.2014.2310482","article-title":"Multipath matching pursuit","volume":"60","author":"Kwon","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.sigpro.2026.110531_bib0030","doi-asserted-by":"crossref","first-page":"495","DOI":"10.4208\/jcm.1505-m4529","article-title":"The performance of orthogonal multi-matching pursuit under the restricted isometry property","volume":"33","author":"Xu","year":"2015","journal-title":"J. Comput. Math."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110531_bib0031","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/abf903","article-title":"Binary sparse signal recovery with binary matching pursuit","volume":"37","author":"Wen","year":"2021","journal-title":"Inverse Probl."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110531_bib0032","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/OJSP.2023.3247301","article-title":"Dynamic orthogonal matching pursuit for sparse data reconstruction","volume":"4","author":"Zhao","year":"2023","journal-title":"IEEE Open J. Signal Process."},{"issue":"5\u20136","key":"10.1016\/j.sigpro.2026.110531_bib0033","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","article-title":"Iterative threshloding for sparse approxiamtions","volume":"14","author":"Blumensath","year":"2008","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110531_bib0034","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","article-title":"Iterative hard threshloding for compressed sensing","volume":"27","author":"Blumensath","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110531_bib0035","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":"2","key":"10.1016\/j.sigpro.2026.110531_bib0036","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.acha.2016.03.002","article-title":"Hard thresholding pursuit algorithms: number of iterations","volume":"41","author":"Bouchot","year":"2016","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.sigpro.2026.110531_bib0037","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s11425-021-1987-2","article-title":"Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms","volume":"66","author":"Zhao","year":"2023","journal-title":"Sci. China Math."},{"key":"10.1016\/j.sigpro.2026.110531_bib0038","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/LSP.2023.3238878","article-title":"Improved RIC bounds in terms of \u03b42s for hard thresholding-Based algorithms","volume":"30","author":"Xie","year":"2023","journal-title":"IEEE Signal Process. Lett."},{"issue":"14","key":"10.1016\/j.sigpro.2026.110531_bib0039","doi-asserted-by":"crossref","first-page":"2606","DOI":"10.1080\/00036811.2024.2311697","article-title":"Sufficient condition based on nearly optimal order RIC for IHT algorithm","volume":"104","author":"Xie","year":"2025","journal-title":"Appl. Anal."},{"key":"10.1016\/j.sigpro.2026.110531_bib0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40314-024-02962-6","article-title":"From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing","volume":"44","author":"Xie","year":"2025","journal-title":"Comput. Appl. Math."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110531_bib0041","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/18.382009","article-title":"De-noising by soft-thresholding","volume":"41","author":"Donoho","year":"1995","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.sigpro.2026.110531_bib0042","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","article-title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","volume":"2","author":"Beck","year":"2009","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110531_bib0043","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."},{"key":"10.1016\/j.sigpro.2026.110531_bib0044","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2021.108148","article-title":"Analysis of optimal thresholding algorithms for compressed sensing","volume":"187","author":"Zhao","year":"2021","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110531_bib0045","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s40305-021-00370-9","article-title":"Newton-type optimal thresholding algorithms for sparse optimization problems","volume":"10","author":"Meng","year":"2022","journal-title":"J. Oper. Res. Soc. China"},{"key":"10.1016\/j.sigpro.2026.110531_bib0046","doi-asserted-by":"crossref","DOI":"10.1007\/s10915-023-02315-1","article-title":"Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems","volume":"96","author":"Sun","year":"2023","journal-title":"J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110531_bib0047","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/ad9d73","article-title":"Dynamic thresholding algorithm with memory for linear inverse problems","volume":"41","author":"Sun","year":"2024","journal-title":"Inverse Probl."},{"key":"10.1016\/j.sigpro.2026.110531_bib0048","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/JSTSP.2009.2039176","article-title":"Optimally tuned iterative reconstruction algorithms for compressed sensing","volume":"4","author":"Maleki","year":"2010","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110531_bib0049","doi-asserted-by":"crossref","first-page":"2019","DOI":"10.1109\/TIT.2015.2399919","article-title":"A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing","volume":"61","author":"Cartis","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.sigpro.2026.110531_bib0050","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","article-title":"Normalized iterative hard threshloding: guaranteed stability and performance","volume":"4","author":"Blumensath","year":"2010","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110531_bib0051","first-page":"289","article-title":"CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion","volume":"4","author":"Blanchard","year":"2015","journal-title":"Inf. Inference"},{"key":"10.1016\/j.sigpro.2026.110531_bib0052","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2023.115264","article-title":"Heavy-ball-based hard thresholding algorithms for sparse signal recovery","volume":"430","author":"Sun","year":"2023","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.sigpro.2026.110531_bib0053","series-title":"Convex Optimization","author":"Boyd","year":"2004"},{"key":"10.1016\/j.sigpro.2026.110531_bib0054","series-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"key":"10.1016\/j.sigpro.2026.110531_bib0055","doi-asserted-by":"crossref","first-page":"6594","DOI":"10.1109\/TSP.2020.3037996","article-title":"Newton-step-based hard thresholding algorithms for sparse signal recovery","volume":"68","author":"Meng","year":"2020","journal-title":"IEEE Trans. Signal Process."},{"issue":"25","key":"10.1016\/j.sigpro.2026.110531_sbref0056","first-page":"807","article-title":"Greedy sparsity-constrained optimization","volume":"14","author":"Bahmani","year":"2013","journal-title":"J. Mach. Learn. Res."},{"issue":"12","key":"10.1016\/j.sigpro.2026.110531_bib0057","doi-asserted-by":"crossref","first-page":"2437","DOI":"10.1109\/TPAMI.2017.2651813","article-title":"Newton-type greedy selection methods for \u21130 -constrained minimization","volume":"39","author":"Yuan","year":"2017","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"10.1016\/j.sigpro.2026.110531_sbref0058","first-page":"1","article-title":"Global and quadratic convergence of Newton hard-thresholding pursuit","volume":"22","author":"Zhou","year":"2021","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110531_bib0059","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","article-title":"Some methods of speeding up the convergence of iteration methods","volume":"4","author":"Polyak","year":"1964","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110531_bib0060","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10915-024-02660-9","article-title":"Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm","volume":"101","author":"He","year":"2024","journal-title":"J. Sci. Comput."},{"issue":"7\u20138","key":"10.1016\/j.sigpro.2026.110531_bib0061","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/j.mcm.2007.03.025","article-title":"Statistical analyses on time complexity and rank consistency between singular value decomposition and the duality approach in AHP: a case study of faculty member selection","volume":"46","author":"Mamat","year":"2007","journal-title":"Math. Comput. Model."},{"key":"10.1016\/j.sigpro.2026.110531_bib0062","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109524","article-title":"Multiple choice hard thresholding pursuit (MCHTP) for simultaneous sparse recovery and sparsity order estimation","volume":"222","author":"Mukhopadhyay","year":"2024","journal-title":"Signal Process."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110531_bib0063","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1109\/LWC.2023.3257998","article-title":"Two choice hard thresholding pursuit (TCHTP) for delay-Doppler channel estimation in OTFS","volume":"12","author":"Kumari","year":"2023","journal-title":"IEEE Wireless Commun. Lett."},{"key":"10.1016\/j.sigpro.2026.110531_bib0064","series-title":"IEEE Int. Symp. Inf. Theory (ISIT)","first-page":"14","article-title":"Subspace thresholding pursuit: a reconstruction algorithm for compressed sensing","author":"Song","year":"2015"},{"key":"10.1016\/j.sigpro.2026.110531_bib0065","unstructured":"M. Grant., S. Boyd, CVX: Matlab Software for Disciplined Convex Programming, version 2.2, 2014."},{"key":"10.1016\/j.sigpro.2026.110531_bib0066","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2025.110032","article-title":"Non-negative sparse signal recovery using the integration of ReLU and hard thresholding pursuit operators","volume":"236","author":"Pradhan","year":"2025","journal-title":"Signal Process."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110531_bib0067","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/nla.1948","article-title":"Performance comparisons of greedy algorithms in compressed sensing","volume":"22","author":"Blanchard","year":"2015","journal-title":"Numer. Linear Algebra Appl."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426000459?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426000459?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:36:53Z","timestamp":1772725013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168426000459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":67,"alternative-id":["S0165168426000459"],"URL":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110531","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pseudo-inverse-based hard thresholding pursuit algorithm with momentum: An innovative second-order method for sparse signal recovery","name":"articletitle","label":"Article Title"},{"value":"Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110531","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":"110531"}}