An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
From MaRDI portal
Recommendations
- A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint
- Minimax sparse principal subspace estimation in high dimensions
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- Alternating direction method of multipliers for sparse principal component analysis
- Sparsistency and agnostic inference in sparse PCA
Cites work
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- First-order methods in optimization
- Generalized power method for sparse principal component analysis
- Gradient-based sparse principal component analysis with extensions to online learning
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 125253 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Monotone Operators and the Proximal Point Algorithm
- Near-optimal stochastic approximation for online principal component estimation
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Proximité et dualité dans un espace hilbertien
- Selective factor extraction in high dimensions
- Sparse principal component analysis and iterative thresholding
- Sparse principal component analysis via regularized low rank matrix approximation
- Spectral operators of matrices
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
Cited in
(7)- 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
- Spectral clustering based on weighted Gaussian kernel function with local density
- Riemannian-based neural network method for solving canonical correlation analysis
- Global bounds of backward errors of polynomial eigenvalue problem solved by a companion linearization
This page was built for publication: An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570966)
