New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition
DOI10.1137/21M1394734zbMath1492.65107arXiv2101.11108OpenAlexW3125250414WikidataQ114074098 ScholiaQ114074098MaRDI QIDQ5863880
Yu Guan, Shuyu Dong, François Glineur, Bin Gao
Publication date: 3 June 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.11108
Riemannian optimizationtensor completionCP decompositionpolyadic decompositionpreconditioned gradient
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Multilinear algebra, tensor calculus (15A69) Methods of reduced gradient type (90C52) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Low-rank tensor completion by Riemannian optimization
- Simple tensor products
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Low rank tensor recovery via iterative hard thresholding
- Riemannian Preconditioning
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- Manopt, a Matlab toolbox for optimization on manifolds
- Tensor decompositions for learning latent variable models
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- Tensor Spaces and Numerical Tensor Calculus
- Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format
- Tensor Completion in Hierarchical Tensor Representations
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Smooth PARAFAC Decomposition for Tensor Completion
- Global rates of convergence for nonconvex optimization on manifolds
- Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- Methods of conjugate gradients for solving linear systems
This page was built for publication: New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition
