Computation of second-order directional stationary points for group sparse optimization

被引:10
作者
Peng, Dingtao [1 ]
Chen, Xiaojun [2 ]
机构
[1] Guizhou Univ, Sch Math & Stat, Guiyang, Guizhou, Peoples R China
[2] Hong Kong Polytech Univ, Dept Appl Math, Hong Kong, Peoples R China
关键词
Group sparse optimization; nonconvex and nonsmooth optimization; composite folded concave penalty; directional stationary point; smoothing method; OPTIMALITY CONDITIONS; VARIABLE SELECTION; REGRESSION; NONSMOOTH; ALGORITHMS; LASSO;
D O I
10.1080/10556788.2019.1684492
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We consider a nonconvex and nonsmooth group sparse optimization problem where the penalty function is the sum of compositions of a folded concave function and the vector norm for each group variable. We show that under some mild conditions a first-order directional stationary point is a strict local minimizer that fulfils the first-order growth condition, and a second-order directional stationary point is a strong local minimizer that fulfils the second-order growth condition. In order to compute second-order directional stationary points, we construct a twice continuously differentiable smoothing problem and show that any accumulation point of the sequence of second-order stationary points of the smoothing problem is a second-order directional stationary point of the original problem. We give numerical examples to illustrate how to compute a second-order directional stationary point by the smoothing method.
引用
收藏
页码:348 / 376
页数:29
相关论文
共 37 条
[31]  
Yang Eunho, 2017, P 34 INT C MACHINE L, V70, P3911
[32]   On second-order directional derivatives [J].
Yang, XQ .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1996, 26 (01) :55-66
[33]   A fast unified algorithm for solving group-lasso penalize learning problems [J].
Yang, Yi ;
Zou, Hui .
STATISTICS AND COMPUTING, 2015, 25 (06) :1129-1141
[34]   CONDITIONS FOR CONVERGENCE OF TRUST REGION ALGORITHMS FOR NONSMOOTH OPTIMIZATION [J].
YUAN, Y .
MATHEMATICAL PROGRAMMING, 1985, 31 (02) :220-228
[35]   NEARLY UNBIASED VARIABLE SELECTION UNDER MINIMAX CONCAVE PENALTY [J].
Zhang, Cun-Hui .
ANNALS OF STATISTICS, 2010, 38 (02) :894-942
[36]  
Zhang T, 2010, J MACH LEARN RES, V11, P1081
[37]   THE COMPOSITE ABSOLUTE PENALTIES FAMILY FOR GROUPED AND HIERARCHICAL VARIABLE SELECTION [J].
Zhao, Peng ;
Rocha, Guilherme ;
Yu, Bin .
ANNALS OF STATISTICS, 2009, 37 (6A) :3468-3497