Variable selection in saturated and supersaturated designs via lp-lq minimization

References

• Abraham, B., H. Chipman, and K. Vijayan. 1999. Some risks in the construction and analysis of supersaturated designs. Technometrics 41 (2):135–41. doi:10.1080/00401706.1999.10485634.
   Web of Science ®Google Scholar
• Beattie, S., D. Fong, and D. Lin. 2002. A two-stage Bayesian model selection strategy for supersaturated designs. Technometrics 44 (1):55–63. doi:10.1198/004017002753398326.
   Web of Science ®Google Scholar
• Beck, A., and M. Teboulle. 2009. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences 2 (1):183–202. doi:10.1137/080716542.
   Web of Science ®Google Scholar
• Booth, K. H., and D. R. Cox. 1962. Some systematic supersaturated designs. Technometrics 4 (4):489–95. doi:10.1080/00401706.1962.10490035.
   Web of Science ®Google Scholar
• Buccini, A., O. De la Cruz Cabrera, M. Donatelli, A. Martinelli, and L. Reichel. 2020. Large-scale regression with non-convex loss and penalty. Applied Numerical Mathematics 157:590–601. doi:10.1016/j.apnum.2020.07.006.
   Web of Science ®Google Scholar
• Buccini, A., M. Pasha, and L. Reichel. 2020. Modulus-based iterative methods for constrained lp-lq minimization. Inverse Problems 36 (8):084,001.
   Web of Science ®Google Scholar
• Buccini, A., and L. Reichel. 2019. An l2-lq regularization method for large discrete ill-posed problems. Journal of Scientific Computing 78:1526–49.
   Web of Science ®Google Scholar
• Buccini, A., and L. Reichel. 2020. An lp-lq minimization method with cross-validation for the restoration of impulse noise contaminated images. Journal of Computational and Applied Mathematics 375:112824.
   Web of Science ®Google Scholar
• Buccini, A., and L. Reichel. 2021. Generalized cross validation for lp−lq minimization. Numerical Algorithms. Advance online publication. doi:10.1007/s11075-021-01087-9.
   Web of Science ®Google Scholar
• Candès, E. J., J. Romberg, and T. Tao. 2006. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory 52 (2):489–509. doi:10.1109/TIT.2005.862083.
   Web of Science ®Google Scholar
• Candès, E., and T. Tao. 2007. The Dantzig selector: Statistical estimation when p is much larger than n. The Annals of Statistics 35 (6):2313–51. doi:10.1214/009053606000001523.
   Web of Science ®Google Scholar
• Candès, E. J., M. B. Wakin, and S. P. Boyd. 2008. Enhancing sparsity by reweighted l1 minimization. Journal of Fourier Analysis and Applications 14 (5-6):877–905.
   Web of Science ®Google Scholar
• Cela, R., R. Phan-Tan-Luu, M. Claeys-Bruno, and M. Sergent. 2012. Fractions of Rechtschaffner matrices as supersaturated designs in screening experiments aimed at evaluating main and two-factor interaction effects. Analytica Chimica Acta 721:44–54. doi:10.1016/j.aca.2012.01.060.
   PubMed Web of Science ®Google Scholar
• Cesa, M., B. Campisi, A. Bizzotto, C. Ferraro, F. Fumagalli, and P. Nimis. 2008. A factor influence study of trace element bioaccumulation in moss bags. Archives of Environmental Contamination and Toxicology 55 (3):386–96. doi:10.1007/s00244-007-9127-9.
   PubMed Web of Science ®Google Scholar
• Chan, R. H., and H. X. Liang. 2014. Half-quadratic algorithm for lp-lq problems with applications to TV-l1 image restoration and compressive sensing. In Efficient algorithms for global optimization methods in computer vision. Lecture Notes in Computer Science, vol. 8293, 78–103. Berlin: Springer.
   Google Scholar
• Donoho, D. L. 2006. Compressed sensing. IEEE Transactions on Information Theory 52 (4):1289–306. doi:10.1109/TIT.2006.871582.
   Web of Science ®Google Scholar
• Fan, J., and R. Li. 2001. Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association 96 (456):1348–60. doi:10.1198/016214501753382273.
   Web of Science ®Google Scholar
• Georgiou, S. D. 2008. Modelling by supersaturated designs. Computational Statistics & Data Analysis 53 (2):428–35. doi:10.1016/j.csda.2008.08.015.
   Web of Science ®Google Scholar
• Georgiou, S. D. 2014. Supersaturated designs: A review of their construction and analysis. Journal of Statistical Planning and Inference 144:92–109. doi:10.1016/j.jspi.2012.09.014.
   Web of Science ®Google Scholar
• Horn, R. A., and C. R. Johnson. 1985. Matrix analysis. Cambridge: Cambridge University Press.
   Google Scholar
• Huang, G., A. Lanza, S. Morigi, L. Reichel, and F. Sgallari. 2017. Majorization-minimization generalized Krylov subspace methods for lp-lq optimization applied to image restoration. BIT Numerical Mathematics 57:351–78.
   Web of Science ®Google Scholar
• Huang, H., J. Y. Yang, and M. Liu. 2014. Functionally induced priors for component wise Gibbs sampler in the analysis of supersaturated designs. Computational Statistics & Data Analysis 72:1–12. doi:10.1016/j.csda.2013.10.022.
   Web of Science ®Google Scholar
• Lanza, A., S. Morigi, L. Reichel, and F. Sgallari. 2015. A generalized Krylov subspace method for lp-lq minimization. SIAM Journal on Scientific Computing 37 (5):S30–S50.
   Web of Science ®Google Scholar
• Lanza, A., S. Morigi, and F. Sgallari. 2016. Constrained TVp-l2 model for image restoration. Journal of Scientific Computing 68:64–91.
   Web of Science ®Google Scholar
• Lenth, R. V. 1989. Quick and easy analysis of unreplicated factorials. Technometrics 31 (4):469–73. doi:10.1080/00401706.1989.10488595.
   Web of Science ®Google Scholar
• Li, R., and D. K. Lin. 2003. Analysis methods for supersaturated design: Some comparisons. Journal of Data Science 1 (3):249–60. doi:10.6339/JDS.2003.01(3).134.
   Google Scholar
• Li, R., and D. Lin. 2002. Data analysis in supersaturated designs. Statistics & Probability Letters 59 (2):135–44. doi:10.1016/S0167-7152(02)00140-2.
   Web of Science ®Google Scholar
• Liu, Z., Z. Wei, and W. Sun. 2014. An iteratively approximated gradient projection algorithm for sparse signal reconstruction. Applied Mathematics and Computation 228:454–62. doi:10.1016/j.amc.2013.10.063.
   Web of Science ®Google Scholar
• Mead, R. 1990. The design of experiments: statistical principles for practical applications. Cambridge: Cambridge University Press.
   Google Scholar
• R Core Team: R. 2019. R Core Team: R: A language and environment for statistical computing. Vienna, Austria: R Foundation for Statistical Computing. https://www.R-project.org/.
   Google Scholar
• Ramlau, R., and C. A. Zarzer. 2012. On the minimization of a Tikhonov functional with a non-convex sparsity constraint. Electronic Transactions on Numerical Analysis. 39:476–507.
   Web of Science ®Google Scholar
• Rechtschaffner, R. L. 1967. Saturated fractions of 2n and 3n factorial designs. Technometrics 9 (4):569–75.
   Web of Science ®Google Scholar
• Rodríguez, P., and B. Wohlberg. 2009. Efficient minimization method for a generalized total variation functional. IEEE Transactions on Image Processing : A Publication of the IEEE Signal Processing Society 18 (2):322–32. doi:10.1109/TIP.2008.2008420.
   PubMed Web of Science ®Google Scholar
• Rudin, L. I., S. Osher, and E. Fatemi. 1992. Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena. 60 (1-4):259–68. doi:10.1016/0167-2789(92)90242-F.
   Web of Science ®Google Scholar
• Subbotin, M. T. 1923. On the law of frequency of error. Matematicheskii Sbornik 31 (2):296–301.
   Google Scholar
• Westfall, P., S. Young, and D. Lin. 1998. Forward selection error control in the analysis of supersaturated designs. Statistica Sinica 8:101–17.
   Web of Science ®Google Scholar
• Wolke, R., and H. Schwetlick. 1988. Iteratively reweighted least squares: algorithms, convergence analysis, and numerical comparisons. SIAM Journal on Scientific and Statistical Computing 9 (5):907–21. doi:10.1137/0909062.
   Web of Science ®Google Scholar
• Yuille, A. L., and A. Rangarajan. 2003. The concave-convex procedure. Neural Computation 15 (4):915–36. doi:10.1162/08997660360581958.
   PubMed Web of Science ®Google Scholar
• Zhao, Y. B., and D. Li. 2012. Reweighted l1-minimization for sparse solutions to underdetermined linear systems. SIAM Journal on Optimization 22 (3):1065–88.
   Web of Science ®Google Scholar