The complexity of matrix completion
From MaRDI portal
Cited in
(20)- Guarantees of Riemannian optimization for low rank matrix completion
- A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
- Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications
- Matrix completion under interval uncertainty
- Minimal rank completions for overlapping blocks
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method
- The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems
- Low rank matrix completion by alternating steepest descent methods
- Relations between least-squares and least-rank solutions of the matrix equation \(AXB=C\)
- A new method based on the manifold-alternative approximating for low-rank matrix completion
- Generalized Wong sequences and their applications to Edmonds' problems
- A simultaneous decomposition of a matrix triplet with applications.
- Matrix completion with sparse measurement errors
- Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
- Some optimization problems on ranks and inertias of matrix-valued functions subject to linear matrix equation restrictions
- Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications
- Finding a low-rank basis in a matrix subspace
- Pauli flow on open graphs with unknown measurement labels
This page was built for publication: The complexity of matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581565)
