A communication-efficient and privacy-aware distributed algorithm for sparse PCA
From MaRDI portal
Publication:6133304
DOI10.1007/s10589-023-00481-4arXiv2106.03320OpenAlexW4365145356MaRDI QIDQ6133304
Publication date: 24 July 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.03320
distributed computingalternating direction method of multiplierssparse PCAoptimization with orthogonality constraints
Cites Work
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- A feasible method for optimization with orthogonality constraints
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- A splitting method for orthogonality constrained problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Sparse principal component analysis via regularized low rank matrix approximation
- Subgradient algorithm on Riemannian manifolds
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Riemannian proximal gradient methods
- NP-hardness and inapproximability of sparse PCA
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Trust-region methods on Riemannian manifolds
- Simultaneous iteration method for symmetric matrices
- A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- The Geometry of Algorithms with Orthogonality Constraints
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
- A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
- Biclustering with heterogeneous variance
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- On Consistency and Sparsity for Principal Components Analysis in High Dimensions
- Optimization algorithms exploiting unitary constraints
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A communication-efficient and privacy-aware distributed algorithm for sparse PCA
