Matrix completion with column outliers and sparse noise

DOI10.1016/j.ins.2021.05.051OpenAlexW3164914200MaRDI QIDQ6065866

Rong Wang, Ziheng Li, Zhanxuan Hu, Xuelong Li, Feiping Nie

Publication date: 11 December 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.05.051

zbMATH Keywords

robustmatrix completionout-of-samplesparse noisecolumn outliers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Low rank matrix completion by alternating steepest descent methods
• Robust bilinear factorization with missing and grossly corrupted observations
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Online Schatten quasi-norm minimization for robust principal component analysis
• Exact matrix completion via convex optimization
• Matrix Completion With Column Manipulation: Near-Optimal Sample-Robustness-Rank Tradeoffs
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Subspace Learning and Imputation for Streaming Big Data Matrices and Tensors
• Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

This page was built for publication: Matrix completion with column outliers and sparse noise