报告人：曾超（香港大学出站博士后）

时  间：5月13日上午10:30

地  点：122cc太阳集成游戏海韵园数理大楼6楼686

内容摘要:

We study the problem of third-order tensor completion based on low CP rank recovery. Due to the NP-hardness of the calculation of CP rank, we propose an approximation method by using the sum of ranks of a few matrices as an upper bound of CP rank. We show that such upper bound is between CP rank and the square of CP rank of a tensor. This approximation would be useful when the CP rank is very small. Numerical algorithms are developed and examples are presented to demonstrate that the tensor completion performance by the proposed method is better than that of existing methods.

个人简介：

曾超于2016年在中国科学技术大学取得博士学位，随后在南开大学、香港浸会大学、及香港大学做博士后。曾超博士的研究涉及数值优化、数值代数、计算几何等方向，已有多篇论文发表在计算数学顶级期刊如SIAM J. Numer. Anal., Numer. Math.等上。

联系人: 杜魁