Sparse optimization for nonconvex group penalized estimation

作者：Lee Sangin; Oh Miae; Kim Yongdai^*

来源：Journal of Statistical Computation and Simulation, 2016, 86(3): 597-610.

DOI：10.1080/00949655.2015.1026822

• concave convex procedure
• group LASSO
• nonconvex penalty
• variable selection

We consider a linear regression model where there are group structures in covariates. The group LASSO has been proposed for group variable selections. Many nonconvex penalties such as smoothly clipped absolute deviation and minimax concave penalty were extended to group variable selection problems. The group coordinate descent (GCD) algorithm is used popularly for fitting these models. However, the GCD algorithms are hard to be applied to nonconvex group penalties due to computational complexity unless the design matrix is orthogonal. In this paper, we propose an efficient optimization algorithm for nonconvex group penalties by combining the concave convex procedure and the group LASSO algorithm. We also extend the proposed algorithm for generalized linear models. We evaluate numerical efficiency of the proposed algorithm compared to existing GCD algorithms through simulated data and real data sets.

• 出版日期2016-2-11