Low-rank tensor completion by Riemannian optimization (Q398628)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Low-rank tensor completion by Riemannian optimization |
scientific article; zbMATH DE number 6330855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low-rank tensor completion by Riemannian optimization |
scientific article; zbMATH DE number 6330855 |
Statements
Low-rank tensor completion by Riemannian optimization (English)
0 references
15 August 2014
0 references
The authors propose a variant of the nonlinear conjugate gradient method for solving the tensor completion problem that employs the framework Riemannian optimization techniques on the manifold of tensors of fixed multilinear rank. Some preliminary numerical results are reported to investigate the effectiveness of the proposed algorithm.
0 references
Tucker decomposition
0 references
Riemannian optimization
0 references
low-rank approximation
0 references
high-dimensionality
0 references
reconstruction
0 references
nonlinear conjugate gradient method
0 references
tensor completion problem
0 references
numerical results
0 references
algorithm
0 references
0 references
0.9183441400527954
0 references
0.8853108286857605
0 references
0.882483959197998
0 references
0.8771663308143616
0 references
0.8531200885772705
0 references
