An Augmented Lagrangian Approach for Sparse Principal Component Analysis

13 July 2009

Papers citing "An Augmented Lagrangian Approach for Sparse Principal Component Analysis"

26 / 26 papers shown

Title
The Distributionally Robust Optimization Model of Sparse Principal Component Analysis Lei Wang Xin Liu Xiaojun Chen 81 0 0 04 Mar 2025
A re-examination to the SCoTLASS problems for SPCA and two projection-based methods for them Qiye Zhang Kuo-Hao Li 31 0 0 02 Jul 2023
A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints Ganzhao Yuan 75 4 0 07 Apr 2023
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization Chuan He Heng Huang Zhaosong Lu 36 2 0 10 Jan 2023
A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees Chuan He Zhaosong Lu Ting Kei Pong 35 7 0 09 Jan 2023
A first-order augmented Lagrangian method for constrained minimax optimization Zhaosong Lu Sanyou Mei 117 6 0 05 Jan 2023
Sparse PCA With Multiple Components Ryan Cory-Wright J. Pauphilet 225 2 0 29 Sep 2022
An Inexact Augmented Lagrangian Algorithm for Training Leaky ReLU Neural Network with Group Sparsity Wei Liu Xin Liu Xiaojun Chen 69 10 0 11 May 2022
A Group Norm Regularized Factorization Model for Subspace Segmentation Xishun Wang Zhouwang Yang Xingye Yue Hui Wang 15 0 0 08 Jan 2020
Supervised Discriminative Sparse PCA for Com-Characteristic Gene Selection and Tumor Classification on Multiview Biological Data Chun-Mei Feng Yong-mei Xu Jin-Xing Liu Ying-Lian Gao C. Zheng 49 49 0 28 May 2019
An Alternating Manifold Proximal Gradient Method for Sparse PCA and Sparse CCA Shixiang Chen Shiqian Ma Lingzhou Xue H. Zou 64 13 0 27 Mar 2019
Robust Sparse Estimation Tasks in High Dimensions Jerry Li 128 27 0 20 Feb 2017
Sparse Recovery via Partial Regularization: Models, Theory and Algorithms Zhaosong Lu Xiaorui Li 42 38 0 23 Nov 2015
Finding Dantzig selectors with a proximity operator based fixed-point algorithm Ashley Prater Lixin Shen B. Suter 53 10 0 19 Feb 2015
Separation of undersampled composite signals using the Dantzig selector with overcomplete dictionaries Ashley Prater Lixin Shen 44 6 0 20 Jan 2015
Sparse Principal Component Analysis via Rotation and Truncation Zhenfang Hu Gang Pan Yueming Wang Zhaohui Wu 104 45 0 06 Mar 2014
A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming Zhaosong Lu Lin Xiao 127 32 0 25 Jun 2013
Do semidefinite relaxations solve sparse PCA up to the information limit? Robert Krauthgamer B. Nadler Dan Vilenchik 116 89 0 16 Jun 2013
Alternating Maximization: Unifying Framework for 8 Sparse PCA Formulations and Efficient Parallel Codes Peter Richtárik Majid Jahani S. Ahipaşaoğlu Martin Takáč 74 29 0 17 Dec 2012
A recursive divide-and-conquer approach for sparse principal component analysis Qian Zhao Deyu Meng Zongben Xu 61 4 0 30 Nov 2012
Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming Zhaosong Lu 114 28 0 10 Oct 2012
Fused Multiple Graphical Lasso Sen Yang Zhaosong Lu Xiaotong Shen Peter Wonka Jieping Ye 133 108 0 10 Sep 2012
Proximal Newton-type methods for minimizing composite functions Jason D. Lee Yuekai Sun M. Saunders 372 306 0 07 Jun 2012
Optimal detection of sparse principal components in high dimension Quentin Berthet Philippe Rigollet 171 284 0 23 Feb 2012
An Alternating Direction Method for Finding Dantzig Selectors Zhaosong Lu Ting Kei Pong Yong Zhang 145 36 0 20 Nov 2010
Computing Optimal Experimental Designs via Interior Point Method Zhaosong Lu Ting Kei Pong 90 1 0 09 Sep 2010