Robust inexact alternating optimization for matrix completion with outliers

DOI10.4208/JCM.1809-M2018-0106zbMATH Open1463.65140OpenAlexW3006762474MaRDI QIDQ3385657FDOQ3385657

Authors: Ji Li, Jian-Feng Cai, Hongkai Zhao 

Publication date: 14 January 2021

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jcm.1809-m2018-0106

Recommendations

• Matrix completion with noisy entries and outliers
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
• Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
• Matrix completion via an alternating direction method
• Robust low-rank matrix completion by Riemannian optimization

zbMATH Keywords

matrix completionoutlier noiseinexact projection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Matrix completion problems (15A83) Nonconvex programming, global optimization (90C26)

Cited In (5)

• Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
• A tensor train approach for internet traffic data completion
• A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
• Low-Rank Matrix Recovery Via Robust Outlier Estimation

This page was built for publication: Robust inexact alternating optimization for matrix completion with outliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385657)