Iterative algorithm for the symmetric and nonnegative tensor completion problem
From MaRDI portal
Recommendations
- Spectral algorithms for tensor completion
- Low-rank tensor completion by Riemannian optimization
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Low rank non-negative triple decomposition and non-negative tensor completion
- An alternating direction algorithm for matrix completion with nonnegative factors
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- Low-rank tensor completion by Riemannian optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the low rank solution of the Q-weighted nearest correlation matrix problem.
- Optimal Joint Diagonalization of Complex Symmetric Third-Order Tensors. Application to Separation of Non Circular Signals
- Parallel matrix factorization for low-rank tensor completion
- Symmetric nonnegative tensors and copositive tensors
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor completion using total variation and low-rank matrix factorization
Cited in
(2)
This page was built for publication: Iterative algorithm for the symmetric and nonnegative tensor completion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967254)
