An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
Authors:
- Yong-Jin LiuYLYong-Jin Liu
- Yuqi WanYWYuqi Wan
- Lanyu LinLLLanyu Lin
- 9 April 2024
- journal article
- research article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 475
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problemComputational Optimization and Applications, 2023
- A Semismooth Newton-based Augmented Lagrangian Algorithm for Density Matrix Least Squares ProblemsJournal of Optimization Theory and Applications, 2022
- An Efficient Hessian Based Algorithm for Singly Linearly and Box Constrained Least Squares RegressionJournal of Scientific Computing, 2021
- Spectral operators of matricesMathematical Programming, 2018
- Near-optimal stochastic approximation for online principal component estimationMathematical Programming, 2017
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problemsMathematical Programming, 2014
- Sparse Principal Component Analysis for Identifying Ancestry‐Informative Markers in Genome‐Wide Association StudiesGenetic Epidemiology, 2012
- Sparse principal component analysis via regularized low rank matrix approximationJournal of Multivariate Analysis, 2008
- A nonsmooth version of Newton's methodMathematical Programming, 1993
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976