Alternating Direction Method of Multipliers for Sparse Principal Component Analysis

查看全文 作　　者：Shiqian [1]Ma

机构地区：[1]Department of Systems Engineering and Engineering Management,The Chinese University of Hong Kong,Shatin,NT,Hong Kong

出　　处：《Journal of the Operations Research Society of China》索引2013年第1卷第2期,共22页

摘　　要：We consider a convex relaxation of sparse principal component analysisproposed by d' Aspremont et al. (SIAM Rev. 49:434 448, 2007). This convex relax-ation is a nonsmooth semidefinite programming problem in which the ξ1 norm of thedesired matrix is imposed in either the objective function or the constraint to improvethe sparsity of the resulting matrix. The sparse principal component is obtained by arank- one decomposition of the resulting sparse matrix. We propose an alternating di-rection method based on a variable-splitting technique and an augmented I agrangianframework for solving this nonsmooth semidefinite programming problem. In con-trast to the first-order method proposed in d' Aspremont et al. (SIAM Rev. 49:434448, 2007), which solves approximately the dual problem of the original semidefiniteprogramming problem, our method deals with the primal problem directly and solvesit exactly, which guarantees that the resulting matrix is a sparse matrix. A globalconvergence result is established for the proposed method. Numerical results on bothsynthetic problems and the real applications from classification of text data and senatevoting data are reported to demonstrate the efficacy of our method. 关键词：Sparse PCA Semidefinite programming Alternating direction method Augmented L agrangian method DEFLATION Projection onto the simplex

相关文献

参考文献（42）
引证文献（5）
耦合文献（0）

参考文献(42)

引证文献(5)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Alternating Direction Method of Multipliers for Sparse Principal Component Analysis

参考文献(42)

引证文献(5)

用户提示