New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition (Q5863880)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7536721
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition |
scientific article; zbMATH DE number 7536721 |
Statements
New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition (English)
0 references
3 June 2022
0 references
tensor completion
0 references
polyadic decomposition
0 references
CP decomposition
0 references
Riemannian optimization
0 references
preconditioned gradient
0 references
0 references
0 references
0 references
0.8621200919151306
0 references
0.8531200885772705
0 references
0.8427897691726685
0 references
0.8412039279937744
0 references
0.8266896605491638
0 references
