An accelerated proximal gradient algorithm for Hankel tensor completion

DOI10.1007/s40305-022-00422-8MaRDI QIDQ6566788

Xiong-Wei Guo, Xi-Hong Yan, Chuanlong Wang

Publication date: 3 July 2024

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

zbMATH Keywords

Hankel tensortensor completionaccelerated proximal gradient algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
• Hankel tensors: associated Hankel matrices and Vandermonde decomposition
• Frequency Domain Subspace Identification Using Nuclear Norm Minimization and Hankel Matrix Realizations
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Exact Tensor Completion Using t-SVD
• Fast Multilinear Singular Value Decomposition for Structured Tensors
• Symmetric Tensors and Symmetric Tensor Rank
• Hankel Tensor Decompositions and Ranks
• Fast Hankel tensor–vector product and its application to exponential data fitting
• Hankel tensors, Vandermonde tensors and their positivities

This page was built for publication: An accelerated proximal gradient algorithm for Hankel tensor completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566788)