Alternating direction method of multipliers for sparse principal component analysis
From MaRDI portal
Publication:457552
Abstract: We consider a convex relaxation of sparse principal component analysis proposed by d'Aspremont et al. in (d'Aspremont et al. SIAM Rev 49:434-448, 2007). This convex relaxation is a nonsmooth semidefinite programming problem in which the norm of the desired matrix is imposed in either the objective function or the constraint to improve the sparsity of the resulting matrix. The sparse principal component is obtained by a rank-one decomposition of the resulting sparse matrix. We propose an alternating direction method based on a variable-splitting technique and an augmented Lagrangian framework for solving this nonsmooth semidefinite programming problem. In contrast to the first-order method proposed in (d'Aspremont et al. SIAM Rev 49:434-448, 2007) that solves approximately the dual problem of the original semidefinite programming problem, our method deals with the primal problem directly and solves it exactly, which guarantees that the resulting matrix is a sparse matrix. Global convergence result is established for the proposed method. Numerical results on both synthetic problems and the real applications from classification of text data and senate voting data are reported to demonstrate the efficacy of our method.
Recommendations
- scientific article; zbMATH DE number 6142618
- An alternating direction method with increasing penalty for stable principal component pursuit
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- An augmented Lagrangian approach for sparse principal component analysis
- Convex approximations to sparse PCA via Lagrangian duality
Cites work
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3894797 (Why is no real title available?)
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A new inexact alternating directions method for monotone variational inequalities
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating direction method for covariance selection models
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An augmented Lagrangian approach for sparse principal component analysis
- Compressed sensing
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient learning of label ranking by soft projections onto polyhedra
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Fast multiple-splitting algorithms for convex optimization
- Generalized power method for sparse principal component analysis
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Optimal solutions for sparse principal component analysis
- Probing the Pareto frontier for basis pursuit solutions
- Projection and deflation method for partial pole assignment in linear state feedback
- Regularization methods for semidefinite programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Semidefinite optimization
- Signal Recovery by Proximal Forward-Backward Splitting
- Smooth minimization of non-smooth functions
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The Split Bregman Method for L1-Regularized Problems
Cited in
(23)- An alternating direction method with increasing penalty for stable principal component pursuit
- A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization
- Alternating direction method of multipliers for real and complex polynomial optimization models
- scientific article; zbMATH DE number 7403729 (Why is no real title available?)
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- [HDDA] sparse subspace constrained partial least squares
- Convex approximations to sparse PCA via Lagrangian duality
- Solving sparse principal component analysis with global support
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- An augmented Lagrangian approach for sparse principal component analysis
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- A coordinate descent MM algorithm for fast computation of sparse logistic PCA
- ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning
- An extragradient-based alternating direction method for convex minimization
- Acceleration of the alternating least squares algorithm for principal components analysis
- Alternating direction method of multipliers for separable convex optimization of real functions in complex variables
- scientific article; zbMATH DE number 6142618 (Why is no real title available?)
- scientific article; zbMATH DE number 7448151 (Why is no real title available?)
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Alternating proximal gradient method for convex minimization
This page was built for publication: Alternating direction method of multipliers for sparse principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457552)
