Low-rank tensor completion by Riemannian optimization (Q398628): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081962379 / rank | |||
Normal rank | |||
Revision as of 17:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Low-rank tensor completion by Riemannian optimization |
scientific article |
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
