An Accelerated Proximal Gradient Algorithm for Hankel Tensor Completion  

作　　者：Chuan-Long Wang Xiong-Wei Guo Xi-Hong Yan 

机构地区：[1]Key Laboratory of Engineering and Computational Science,Shanxi Provincial Department of Education,Jinzhong 030619,Shanxi,China [2]Department of Mathematics,Taiyuan Normal University,Jinzhong 030619,Shanxi,China

出　　处：《Journal of the Operations Research Society of China》2024年第2期461-477,共17页中国运筹学会会刊（英文）

摘　　要：In this paper,an accelerated proximal gradient algorithm is proposed for Hankel tensor completion problems.In our method,the iterative completion tensors generated by the new algorithm keep Hankel structure based on projection on the Hankel tensor set.Moreover,due to the special properties of Hankel structure,using the fast singular value thresholding operator of the mode-s unfolding of a Hankel tensor can decrease the computational cost.Meanwhile,the convergence of the new algorithm is discussed under some reasonable conditions.Finally,the numerical experiments show the effectiveness of the proposed algorithm.

关 键 词：Hankel tensor Tensor completion Accelerated proximal gradient algorithm 

分 类 号：O17[理学—数学]