Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
From MaRDI portal
Publication:2095166
DOI10.1016/j.cam.2022.114866zbMath1501.15020OpenAlexW4300772392WikidataQ115359636 ScholiaQ115359636MaRDI QIDQ2095166
Guang-Jing Song, Xue-Zhong Wang, Michael Kwok-Po 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
Convex programming (90C25) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)
Related Items
Robust low-rank tensor completion via new regularized model with approximate SVD ⋮ Riemannian conjugate gradient method for low-rank tensor completion
Cites Work
- Tensor Decompositions and Applications
- On tensor completion via nuclear norm minimization
- Factorization strategies for third-order tensors
- Tensor-tensor products with invertible linear transforms
- A guided tour of Chernoff bounds
- On polynomial time methods for exact low-rank tensor completion
- Guarantees of Riemannian optimization for low rank matrix completion
- On manifolds of tensors of fixed TT-rank
- Exact matrix completion via convex optimization
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- Low-Rank Matrix Completion by Riemannian Optimization
- Introduction to Smooth Manifolds
- Projection-like Retractions on Matrix Manifolds
- A Riemannian trust-region method for low-rank tensor completion
- Robust tensor completion using transformed tensor singular value decomposition
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Exact Tensor Completion Using t-SVD
- An Order-$p$ Tensor Factorization with Applications in Imaging
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Fundamental Conditions for Low-CP-Rank Tensor Completion
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- A Simpler Approach to Matrix Completion
This page was built for publication: Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion