A fast tri-factorization method for low-rank matrix recovery and completion
From MaRDI portal
Publication:456030
Recommendations
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Fixed point and Bregman iterative methods for matrix rank minimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Robust principal component analysis: a factorization-based approach with linear complexity
Cited in
(9)- Robust low-rank tensor completion via new regularized model with approximate SVD
- Alternating direction method of multipliers for generalized low-rank tensor recovery
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Robust graph regularized nonnegative matrix factorization for clustering
- Robust Manhattan non-negative matrix factorization for image recovery and representation
- An inexact splitting method for the subspace segmentation from incomplete and noisy observations
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
This page was built for publication: A fast tri-factorization method for low-rank matrix recovery and completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456030)