Rank determination for low-rank data completion
From MaRDI portal
Publication:4637013
Recommendations
Cites work
- scientific article; zbMATH DE number 5161643 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- Deterministic network coding by matrix completion
- Exact matrix completion via convex optimization
- Fundamental conditions for low-CP-rank tensor completion
- Low-rank matrix completion using alternating minimization
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Phase retrieval via matrix completion
- Rank determination for low-rank data completion
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(7)- Typical and generic ranks in matrix completion
- Stability Approach to Regularization Selection for Reduced-Rank Regression
- Union of low-rank tensor spaces: clustering and completion
- Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval
- Rank determination for low-rank data completion
- Fundamental conditions for low-CP-rank tensor completion
- Characterization of sampling patterns for low-tt-rank tensor retrieval
This page was built for publication: Rank determination for low-rank data completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637013)