Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression

References

• Breheny, P., and Huang, J. (2011), “Coordinate Descent Algorithms for Nonconvex Penalized Regression, With Applications to Biological Feature Selection,” The Annals of Applied Statistics, 5, 232–253.
   PubMed Web of Science ®Google Scholar
• Bühlmann, P., Kalisch, M., and Meier, L. (2014), “High-Dimensional Statistics With a View Toward Applications in Biology,” Annual Review of Statistics and Its Application, 1, 255–278.
   Web of Science ®Google Scholar
• Chen, X., Nashed, Z., and Qi, L. (2000), “Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations,” SIAM Journal on Numerical Analysis, 38, 1200–1216.
   Web of Science ®Google Scholar
• Clarke, F. H. (1983), Optimization and Nonsmooth Analysis, New York: Wiley.
   Google Scholar
• Combettes, P. L., and Wajs, V. R. (2005), “Signal Recovery by Proximal Forward-Backward Splitting,” Multiscale Modeling & Simulation, 4, 1168–1200.
   Web of Science ®Google Scholar
• Friedman, J., Hastie, T., Höfling, H., and Tibshirani, R. (2007), “Pathwise Coordinate Optimization,” The Annals of Applied Statistics, 1, 302–332.
   Web of Science ®Google Scholar
• Friedman, J., Hastie, T., and Tibshirani, R. (2010), “Regularization Paths for Generalized Linear Models via Coordinate Descent,” Journal of Statistical Software, 33, 1–22.
   PubMed Web of Science ®Google Scholar
• Holland, P. W., and Welsch, R. E. (1977), “Robust Regression Using Iteratively Reweighted Least-Squares,” Communications in Statistics—Theory and Methods, 6, 813–827.
   Web of Science ®Google Scholar
• Huber, P. J. (1973), “Robust Regression: Asymptotics, Conjectures and Monte Carlo,” The Annals of Statistics, 1, 799–821.
   Web of Science ®Google Scholar
• Ito, K., and Kunisch, K. (2008), Lagrange Multiplier Approach to Variational Problems and Applications, Philadelphia, PA: SIAM.
   Google Scholar
• Koenker, R., and Bassett Jr, G. (1978), “Regression Quantiles,” Econometrica, 46, 33–50.
   Web of Science ®Google Scholar
• Koenker, R., and Machado, J. A. (1999), “Goodness of Fit and Related Inference Processes for Quantile Regression,” Journal of the American Statistical Association, 94, 1296–1310.
   Web of Science ®Google Scholar
• Li, Y., and Arce, G. R. (2004), “A Maximum Likelihood Approach to Least Absolute Deviation Regression,” EURASIP Journal on Advances in Signal Processing, 2004, 1–8.
   Web of Science ®Google Scholar
• Mifflin, R. (1977), “Semismooth and Semiconvex Functions in Constrained Optimization,” SIAM Journal on Control and Optimization, 15, 959–972.
   Web of Science ®Google Scholar
• Osborne, M., and Turlach, B. (2011), “A Homotopy Algorithm for the Quantile Regression Lasso and Related Piecewise Linear Problems,” Journal of Computational and Graphical Statistics, 20, 972–987.
   Web of Science ®Google Scholar
• Peng, B., and Wang, L. (2015), “An Iterative Coordinate Descent Algorithm for High-Dimensional Nonconvex Penalized Quantile Regression,” Journal of Computational and Graphical Statistics, 24, 676–694.
   Web of Science ®Google Scholar
• Portnoy, S., and Koenker, R. (1997), “The Gaussian Hare and the Laplacian Tortoise: Computability of Squared-Error Versus Absolute-Error Estimators,” Statistical Science, 12, 279–300.
   Web of Science ®Google Scholar
• Qi, L., and Sun, J. (1993), “A Nonsmooth Version of Newton's Method,” Mathematical Programming, 58, 353–367.
   Web of Science ®Google Scholar
• Rockafellar, R. T. (1970), Convex Analysis, Princeton, NJ: Princeton University Press.
   Google Scholar
• Simon, N., Friedman, J., Hastie, T., and Tibshirani, R. (2011), “Regularization Paths for Cox's Proportional Hazards Model via Coordinate Descent,” Journal of Statistical Software, 39, 1–13.
   PubMed Web of Science ®Google Scholar
• Tibshirani, R. (1996), “Regression Shrinkage and Selection via the Lasso,” Journal of the Royal Statistical Society, Series B, 58, 267–288.
   Google Scholar
• Tibshirani, R., Bien, J., Friedman, J., Hastie, T., Simon, N., Taylor, J., and Tibshirani, R. J. (2012), “Strong Rules for Discarding Predictors in Lasso-Type Problems,” Journal of the Royal Statistical Society, Series B, 74, 245–266.
   Google Scholar
• Tseng, P. (2001), “Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization,” Journal of Optimization Theory and Applications, 109, 475–494.
   Web of Science ®Google Scholar
• Wang, L., Wu, Y., and Li, R. (2012), “Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension,” Journal of the American Statistical Association, 107, 214–222.
   PubMed Web of Science ®Google Scholar
• Wu, T. T., and Lange, K. (2008), “Coordinate Descent Algorithms for Lasso Penalized Regression,” The Annals of Applied Statistics, 2, 224–244.
   Web of Science ®Google Scholar
• Zou, H., and Hastie, T. (2005), “Regularization and Variable Selection via the Elastic Net,” Journal of the Royal Statistical Society, Series B, 67, 301–320.
   Google Scholar