An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
From MaRDI portal
Publication:6570966
DOI10.1016/j.amc.2024.128708zbMath1545.90108MaRDI QIDQ6570966
Yuqi Wan, Lanyu Lin, Yong-Jin Liu
Publication date: 11 July 2024
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Factor analysis and principal components; correspondence analysis (62H25) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90)
Related Items (4)
MPCA and MDA via Einstein product ⋮ Inertial methods for split common fixed point problems: application to binary classification in machine learning ⋮ Numerical methods for QBD matrix equations ⋮ On perturbations for spectrum and singular value decompositions followed by deflation techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse principal component analysis and iterative thresholding
- Near-optimal stochastic approximation for online principal component estimation
- Sparse principal component analysis via regularized low rank matrix approximation
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- A nonsmooth version of Newton's method
- Spectral operators of matrices
- A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
- Generalized power method for sparse principal component analysis
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- First-Order Methods in Optimization
- Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector
- A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems
- Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian
- Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
- Selective factor extraction in high dimensions
- Proximité et dualité dans un espace hilbertien
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- Gradient-based sparse principal component analysis with extensions to online learning
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
This page was built for publication: An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
