Online Schatten quasi-norm minimization for robust principal component analysis
DOI10.1016/J.INS.2018.10.003zbMATH Open1450.62068OpenAlexW2895468745WikidataQ129133946 ScholiaQ129133946MaRDI QIDQ2201647FDOQ2201647
Hua Huang, Chen Xu, Xixi Jia, Weiwei Wang, Xiangchu Feng
Publication date: 29 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.10.003
Nonparametric robustness (62G35) Factor analysis and principal components; correspondence analysis (62H25) Stochastic approximation (62L20)
Cites Work
- Title not available (Why is that?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Online learning for matrix factorization and sparse coding
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
- On incremental and robust subspace learning
- Online optimization for max-norm regularization
- Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
- Weighted nuclear norm minimization and its applications to low level vision
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
Cited In (5)
- Accelerated matrix completion algorithm using continuation strategy and randomized SVD
- Dual robust regression for pattern classification
- Matrix completion with column outliers and sparse noise
- A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation
- Adaptive robust principal component analysis
Uses Software
Recommendations
- Compressive Online Robust Principal Component Analysis via <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math> </inline-formula>-<inline-formula> <tex-m π π
- Near-optimal stochastic approximation for online principal component estimation π π
- Nearly optimal stochastic approximation for online principal subspace estimation π π
- An alternating minimization method for robust principal component analysis π π
- Stochastic Gauss-Newton algorithms for online PCA π π
- Gradient-based sparse principal component analysis with extensions to online learning π π
- On the Complexity of Robust PCA and β1-Norm Low-Rank Matrix Approximation π π
- ι²ζ£ηη¨η Lp -樑主ζεεζ π π
- Optimization of on-line principal component analysis π π
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds π π
This page was built for publication: Online Schatten quasi-norm minimization for robust principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201647)
