Riemannian conjugate gradient method for low-rank tensor completion
DOI10.1007/S10444-023-10036-0zbMATH Open1519.15022OpenAlexW4380484498MaRDI QIDQ6132849FDOQ6132849
Jiaofen Li, Shan-Qi Duan, Xuefeng Duan, Chunmei 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
Recommendations
- Low-rank tensor completion by Riemannian optimization
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
- A Riemannian trust-region method for low-rank tensor completion.
- Riemannian optimization for high-dimensional tensor completion
convergence analysislow-rank tensor completiontensor singular value decompositionRiemannian conjugate gradient descent method
Convex programming (90C25) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Differential geometric aspects in vector and tensor analysis (53A45) Numerical methods for variational inequalities and related problems (65K15) Real-valued functions on manifolds (58C05)
Cites Work
- Function minimization by conjugate gradients
- Title not available (Why is that?)
- Tensor Decompositions and Applications
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Factorization strategies for third-order tensors
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Parallel matrix factorization for low-rank tensor completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Low-rank tensor completion by Riemannian optimization
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Title not available (Why is that?)
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- 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
- A new, globally convergent Riemannian conjugate gradient method
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- The geometry of algorithms using hierarchical tensors
- Third-order tensors as linear operators on a space of matrices
- Tensor completion using total variation and low-rank matrix factorization
- An Order-$p$ Tensor Factorization with Applications in Imaging
- Tensor-tensor products with invertible linear transforms
- Riemannian optimization for high-dimensional tensor completion
- A Riemannian trust-region method for low-rank tensor completion
- Exact Tensor Completion Using t-SVD
- A non-convex tensor rank approximation for tensor completion
- Tensor Factorization for Low-Rank Tensor Completion
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- Robust Schatten-\(p\) norm based approach for tensor completion
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
Cited In (1)
This page was built for publication: Riemannian conjugate gradient method for low-rank tensor completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132849)
