Robust inexact alternating optimization for matrix completion with outliers
From MaRDI portal
Publication:3385657
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
Cited in
(10)- A tensor train approach for internet traffic data completion
- Matrix completion with column outliers and sparse noise
- A generalized robust minimization framework for low-rank matrix recovery
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Low-Rank Matrix Recovery Via Robust Outlier Estimation
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
- Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
- Matrix completion with noisy entries and outliers
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)
