Parallel active subspace decomposition for tensor robust principal component analysis
From MaRDI portal
Publication:2667350
DOI10.1007/s42967-020-00063-9zbMath1476.62018OpenAlexW3016237996MaRDI QIDQ2667350
Xue-Zhong Wang, Michael Kwok-Po Ng
Publication date: 24 November 2021
Published in: Communications on Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s42967-020-00063-9
principal component analysismatrix factorizationnuclear norm minimizationlow-rank tensorsactive subspace decomposition
Computational methods for problems pertaining to statistics (62-08) Factor analysis and principal components; correspondence analysis (62H25) Numerical linear algebra (65F99)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Parallel matrix factorization for low-rank tensor completion
- Tucker factorization with missing data with application to low-\(n\)-rank tensor completion
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Active Subspace: Toward Scalable Low-Rank Learning
- Robust Low-Rank Tensor Recovery: Models and Algorithms
- Robust principal component analysis?
- Tensor completion and low-n-rank tensor recovery via convex optimization
- A Fixed Point Iterative Method for Low $n$-Rank Tensor Pursuit