activity
20202025
most citedNew Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

10 citations · 14 across the 7 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

math.NA2020★ 4 cited

Alternating minimization algorithms for graph regularized tensor completion

Yu Guan, Shuyu Dong, Bin Gao +2

We consider a Canonical Polyadic (CP) decomposition approach to low-rank tensor completion (LRTC) by incorporating external pairwise similarity relations through graph Laplacian re…