Riemannian conjugate gradient method for low-rank tensor completion
DOI10.1007/s10444-023-10036-0zbMath1519.15022OpenAlexW4380484498MaRDI QIDQ6132849
Jiao-Fen Li, Shan-Qi Duan, Xue-Feng Duan, Chun-Mei Li
Publication date: 14 July 2023
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-023-10036-0
convergence analysislow-rank tensor completiontensor singular value decompositionRiemannian conjugate gradient descent method
Convex programming (90C25) Differential geometric aspects in vector and tensor analysis (53A45) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Real-valued functions on manifolds (58C05) Matrix completion problems (15A83) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Parallel matrix factorization for low-rank tensor completion
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- The geometry of algorithms using hierarchical tensors
- Low-rank tensor completion by Riemannian optimization
- Factorization strategies for third-order tensors
- Tensor-tensor products with invertible linear transforms
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Tensor completion using total variation and low-rank matrix factorization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data
- Robust Schatten-\(p\) norm based approach for tensor completion
- A non-convex tensor rank approximation for tensor completion
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
- Riemannian Optimization for High-Dimensional Tensor Completion
- Low-Rank Matrix Completion by Riemannian Optimization
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
- Tensor completion and low-n-rank tensor recovery via convex optimization
- A Riemannian trust-region method for low-rank tensor completion
- Tensor Factorization for Low-Rank Tensor Completion
- Exact Tensor Completion Using t-SVD
- An Order-$p$ Tensor Factorization with Applications in Imaging
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A new, globally convergent Riemannian conjugate gradient method
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Function minimization by conjugate gradients
- Third-order tensors as linear operators on a space of matrices
This page was built for publication: Riemannian conjugate gradient method for low-rank tensor completion
