Online Schatten quasi-norm minimization for robust principal component analysis

DOI10.1016/J.INS.2018.10.003MaRDI QIDQ2201647zbMATH OpenOpenAlexWikidataFDO

Authors Xixi Jia, Hua Huang, Chen Xu, Xiangchu Feng, Weiwei Wang

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

zbMATH Keywords

low rank approximationstochastic optimizationSchatten quasi-normonline low rank

Mathematics Subject Classification ID

Nonparametric robustness (62G35) Factor analysis and principal components; correspondence analysis (62H25) Stochastic approximation (62L20)

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 \(\ell_1\)-norm low-rank matrix approximation
• Robust sparse \(L_p\)-norm principal component analysis
• Optimization of on-line principal component analysis
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds

Cites work

• A Singular Value Thresholding Algorithm for Matrix Completion
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Exact matrix completion via convex optimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
• Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
• On incremental and robust subspace learning
• Online learning for matrix factorization and sparse coding
• Online optimization for max-norm regularization
• Restricted p-Isometry Properties of Nonconvex Matrix Recovery
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• 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

Cited in

(6)

• 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
• Online optimization for max-norm regularization

Describes a project that uses

Uses Software

• RASL

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)