0 Trend Filtering

Published Online:https://doi.org/10.1287/ijoc.2021.0313

References

  • Baranowski R, Chen Y, Fryzlewicz P (2019) Narrowest-over-threshold detection of multiple change points and change-point-like features. J. R. Statist. Soc. Ser. B. Statist. Methodol. 81(3):649–672.CrossrefGoogle Scholar
  • Bertsimas D, King A, Mazumder R, et al.. (2016) Best subset selection via a modern optimization lens. Ann. Statist. 44(2):813–852.CrossrefGoogle Scholar
  • Blumensath T, Davies ME (2009) Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3):265–274.CrossrefGoogle Scholar
  • Chow ECH, Li RC, Zhou W (2018) Influence of tropical cyclones on Hong Kong air quality. Adv. Atmos. Sci. 35(9):1177–1188.CrossrefGoogle Scholar
  • Donoho DL (1995) De-noising by soft-thresholding. IEEE Trans. Inform. Theory 41(3):613–627.CrossrefGoogle Scholar
  • Fearnhead P, Maidstone R, Letchford A (2019) Detecting changes in slope with an l0 penalty. J. Comput. Graph. Statist. 28(2):265–275.CrossrefGoogle Scholar
  • Foucart S (2011) Hard thresholding pursuit: An algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6):2543–2563.CrossrefGoogle Scholar
  • Furnival GM, Wilson RW (1974) Regressions by leaps and bounds. Technometrics 16(4):499–511.CrossrefGoogle Scholar
  • Hampel FR (1974) The influence curve and its role in robust estimation. J. Amer. Statist. Assoc. 69(346):383–393.CrossrefGoogle Scholar
  • Harchaoui Z, Lévy-Leduc C (2010) Multiple change-point estimation with a total variation penalty. J. Amer. Statist. Assoc. 105(492):1480–1493.CrossrefGoogle Scholar
  • Hintermüller M, Ito K, Kunisch K (2002) The primal-dual active set strategy as a semismooth newton method. SIAM J. Optim. 13(3):865–888.CrossrefGoogle Scholar
  • Hodrick RJ, Prescott EC (1997) Postwar US business cycles: An empirical investigation. J. Money Credit Bank. 29(1):1–16.CrossrefGoogle Scholar
  • Huang J, Jiao Y, Liu Y, Lu X (2018) A constructive approach to l0 penalized regression. J. Mach. Learn. Res. 19(10):1–37.Google Scholar
  • Ito K, Kunisch K (2000) Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces. Nonliner Anal. Theory Methods Appl. 41(5–6):591–616.CrossrefGoogle Scholar
  • Ito K, Kunisch K (2013) A variational approach to sparsity optimization based on Lagrange multiplier theory. Inverse Problems 30(1):015001.CrossrefGoogle Scholar
  • Jiao Y, Jin B, Lu X (2015) A primal dual active set with continuation algorithm for the ℓ0-regularized optimization problem. Appl. Comput. Harmon. Anal. 39(3):400–426.CrossrefGoogle Scholar
  • Johnson NA (2013) A dynamic programming algorithm for the fused lasso and l0-segmentation. J. Comput. Graph. Statist. 22(2):246–260.CrossrefGoogle Scholar
  • Killick R, Fearnhead P, Eckley IA (2012) Optimal detection of changepoints with a linear computational cost. J. Amer. Statist. Assoc. 107(500):1590–1598.CrossrefGoogle Scholar
  • Kim SJ, Koh K, Boyd S, Gorinevsky D (2009) ℓ1 trend filtering. SIAM Rev. 51(2):339–360.CrossrefGoogle Scholar
  • Mammen E, van de Geer S (1997) Locally adaptive regression splines. Ann. Statist. 25(1):387–413.CrossrefGoogle Scholar
  • Miller A (2002) Subset Selection in Regression (Chapman and Hall/CRC, Boca Raton, FL).CrossrefGoogle Scholar
  • Nocedal J, Wright SJ (2006) Numerical Optimization, 2nd ed. (Springer, New York).Google Scholar
  • Phillips PC, Shi Z (2020) Boosting: Why you can use the HP filter. Internat. Econom. Rev. 62(2):521–570.CrossrefGoogle Scholar
  • Politsch CA, Cisewski-Kehe J, Croft R, Wasserman L (2020) Trend filtering—I. A modern statistical tool for time-domain astronomy and astronomical spectroscopy. Monthly Notices Royal Astronomical Soc. 492(3):4005–4018.CrossrefGoogle Scholar
  • Ramdas A, Tibshirani RJ (2016) Fast and flexible ADMM algorithms for trend filtering. J. Comput. Graph. Statist. 25(3):839–858.CrossrefGoogle Scholar
  • Rojas CR, Wahlberg B (2014) On change point detection using the fused lasso method. Preprint, submitted January 21, https://arxiv.org/abs/1401.5408.Google Scholar
  • Rudin LI, Osher S, Fatemi E (1992) Nonlinear total variation based noise removal algorithms. Phys. D. 60(1–4):259–268.CrossrefGoogle Scholar
  • Schwarz G (1978) Estimating the dimension of a model. Ann. Statist. 6(2):461–464.CrossrefGoogle Scholar
  • Spiriti S, Eubank R, Smith PW, Young D (2013) Knot selection for least-squares and penalized splines. J. Statist. Comput. Simul. 83(6):1020–1036.CrossrefGoogle Scholar
  • Steidl G, Didas S, Neumann J (2006) Splines in higher order tv regularization. Internat. J. Comput. Vis. 70(3):241–255.CrossrefGoogle Scholar
  • Tibshirani R, Saunders M, Rosset S, Zhu J, Knight K (2005) Sparsity and smoothness via the fused lasso. J. R. Statist. Soc. Ser. B. Statist. Methodol. 67(1):91–108.CrossrefGoogle Scholar
  • Tibshirani RJ (2014) Adaptive piecewise polynomial estimation via trend filtering. Ann. Statist. 42(1):285–323.CrossrefGoogle Scholar
  • Tibshirani RJ, Taylor J (2011) The solution path of the generalized lasso. Ann. Statist. 39(3):1335–1371.CrossrefGoogle Scholar
  • Wakayama T, Sugasawa S (2022) Trend filtering for functional data. Preprint, submitted April 6, 2021, https://arxiv.org/abs/2104.02456.Google Scholar
  • Wei X, Liu Y, Li L (2019) Numerical study of a local pm2.5 pollution event under the typhoon Neoguri (1408) background over a coastal metropolitan city, Shenzhen, China. Phys. Chem. Earth Parts ABC. 110:99–108.CrossrefGoogle Scholar
  • Wen C, Wang X, Zhang A (2023) ℓ0 trend filtering. http://dx.doi.org/10.1287/ijoc.2021.0313.cd, https://github.com/INFORMSJoC/2021.0313.Google Scholar
  • Wen C, Zhang A, Quan S, Wang X (2020) BeSS: An R package for best subset selection in linear, logistic and coxph models. J. Stat. Softw. 94:1–24.CrossrefGoogle Scholar
  • Yao YC (1988) Estimating the number of change-points via Schwarz’ criterion. Statist. Probab. Lett. 6(3):181–189.CrossrefGoogle Scholar
  • Yuan XT, Li P, Zhang T (2018) Gradient hard thresholding pursuit. J. Mach. Learn. Res. 18(166):1–43.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.