most citedNew Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

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

collaborators

2 papers

math.OC2021★ 10 cited

New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

Shuyu Dong, Bin Gao, Yu Guan +1

We propose new Riemannian preconditioned algorithms for low-rank tensor completion via the polyadic decomposition of a tensor. These algorithms exploit a non-Euclidean metric on th…

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…