Online Schatten quasi-norm minimization for robust principal component analysis
From MaRDI portal
Publication:2201647
DOI10.1016/j.ins.2018.10.003zbMath1450.62068OpenAlexW2895468745WikidataQ129133946 ScholiaQ129133946MaRDI QIDQ2201647
Hua Huang, Chen Xu, Xixi Jia, Wei-wei Wang, Xiang Chu 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
Factor analysis and principal components; correspondence analysis (62H25) Nonparametric robustness (62G35) Stochastic approximation (62L20)
Related Items
Adaptive robust principal component analysis ⋮ Matrix completion with column outliers and sparse noise ⋮ Accelerated matrix completion algorithm using continuation strategy and randomized SVD ⋮ Dual robust regression for pattern classification
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On incremental and robust subspace learning
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Online optimization for max-norm regularization
- Weighted nuclear norm minimization and its applications to low level vision
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
This page was built for publication: Online Schatten quasi-norm minimization for robust principal component analysis
