Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
DOI10.1016/J.CAM.2022.114866zbMATH Open1501.15020OpenAlexW4300772392WikidataQ115359636 ScholiaQ115359636MaRDI QIDQ2095166FDOQ2095166
G. J. Song, Xuezhong Wang, Michael Ng
Publication date: 9 November 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114866
Recommendations
- Riemannian conjugate gradient method for low-rank tensor completion
- Low-rank tensor completion by Riemannian optimization
- Guarantees of Riemannian optimization for low rank matrix completion
- Riemannian optimization for high-dimensional tensor completion
- A Riemannian trust-region method for low-rank tensor completion.
Convex programming (90C25) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)
Cites Work
- Tensor Decompositions and Applications
- Exact matrix completion via convex optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Factorization strategies for third-order tensors
- Introduction to Smooth Manifolds
- Matrix Completion From a Few Entries
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Low-rank matrix completion by Riemannian optimization
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- A Simpler Approach to Matrix Completion
- A guided tour of Chernoff bounds
- On tensor completion via nuclear norm minimization
- Projection-like retractions on matrix manifolds
- On manifolds of tensors of fixed TT-rank
- An Order-$p$ Tensor Factorization with Applications in Imaging
- Tensor-tensor products with invertible linear transforms
- A Riemannian trust-region method for low-rank tensor completion
- Exact Tensor Completion Using t-SVD
- Guarantees of Riemannian optimization for low rank matrix recovery
- On polynomial time methods for exact low-rank tensor completion
- Robust tensor completion using transformed tensor singular value decomposition
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- Guarantees of Riemannian optimization for low rank matrix completion
- Fundamental Conditions for Low-CP-Rank Tensor Completion
Cited In (5)
- Tensor completion by multi-rank via unitary transformation
- New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
- Riemannian conjugate gradient method for low-rank tensor completion
- Self representation based methods for tensor completion problem
- Robust low-rank tensor completion via new regularized model with approximate SVD
This page was built for publication: Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095166)
