{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T13:14:10Z","timestamp":1783602850345,"version":"3.55.0"},"reference-count":22,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2595"],"award-info":[{"award-number":["N00014-20-1-2595"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0025555"],"award-info":[{"award-number":["DE-SC0025555"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Numer. Anal."],"published-print":{"date-parts":[[2026,8,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Lasso regression is a widely employed approach within the [Formula: see text] regularization framework used to promote sparsity and recover piecewise smooth signals [Formula: see text] when the given observations are obtained from noisy, blurred, and\/or incomplete data environments. In choosing the regularizing sparsity-promoting operator, it is assumed that the particular type of variability of the underlying signal, for example, piecewise constant or piecewise linear behavior across the entire domain, is both known and fixed. Such an assumption is problematic in more general cases, e.g., when a signal exhibits piecewise oscillatory behavior with varying wavelengths and magnitudes. To address the limitations of assuming a fixed (and typically low order) variability when choosing a sparsity-promoting operator, this investigation proposes a novel residual transform operator that can be used within the Lasso regression formulation. In a nutshell, the idea is that for a general piecewise smooth signal [Formula: see text], it is possible to design two operators [Formula: see text] and [Formula: see text] such that [Formula: see text], where [Formula: see text] is a discretized approximation of [Formula: see text], but [Formula: see text]. The corresponding residual transform operator, [Formula: see text], yields a result that (1) effectively reduces the variability dependent error that occurs when applying either [Formula: see text] or [Formula: see text] to [Formula: see text], a property that holds even when [Formula: see text] is not a good approximation to the true sparse domain vector of [Formula: see text], and (2) does not require [Formula: see text] or [Formula: see text] to have prior information regarding the variability of the underlying signal. Numerical experiments demonstrate the effectiveness of the new residual transform operator when compared to standard sparsity-promoting operators used in Lasso regression for recovering piecewise smooth signals.<\/jats:p>","DOI":"10.1137\/25m1772113","type":"journal-article","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T12:21:41Z","timestamp":1783599701000},"page":"1217-1238","source":"Crossref","is-referenced-by-count":0,"title":["A New Sparsity Promoting Residual Transform Operator for Lasso Regression"],"prefix":"10.1137","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0850-9624","authenticated-orcid":true,"given":"Yao","family":"Xiao","sequence":"first","affiliation":[{"name":"Department of Mathematics, Dartmouth College, Hanover, NH 03755 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9219-4572","authenticated-orcid":true,"given":"Anne","family":"Gelb","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Dartmouth College, Hanover, NH 03755 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aditya","family":"Viswanathan","sequence":"additional","affiliation":[{"name":"Mathematics and Statistics, University of Michigan-Dearborn, Dearborn, MI 48128 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2026,7,9]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-015-0088-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142903435259"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"R. Chartrand and W. Yin, Iteratively reweighted algorithms for compressive sensing, in Proceedings of the International Conference on Acoustics, Speech and Signal Processing, IEEE, 2008, pp. 3869\u20133872.","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"ref9","unstructured":"CVX: Matlab Software for Disciplined Convex Programming, Version 2.0, CVX Research, 2012, http:\/\/cvxr.com\/cvx."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/acha.1999.0262"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142999359153"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1051\/m2an:2002008"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-006-9088-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/080725891"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511618352"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2020.01.015"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-011-9536-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-011-9524-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/090767558"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-022-01850-7"}],"container-title":["SIAM Journal on Numerical Analysis"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T12:21:42Z","timestamp":1783599702000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/25M1772113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,9]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8,31]]}},"alternative-id":["10.1137\/25M1772113"],"URL":"https:\/\/doi.org\/10.1137\/25m1772113","relation":{},"ISSN":["0036-1429","1095-7170"],"issn-type":[{"value":"0036-1429","type":"print"},{"value":"1095-7170","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,9]]}}}