An accelerated proximal gradient algorithm for Hankel tensor completion
From MaRDI portal
Recommendations
- Structure-preserving thresholding algorithm based on l_-norm for Hankel matrix completion
- Structure-preserving thresholding algorithm based on F-norm for Hankel matrix completion
- Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
- An inexact continuation accelerated proximal gradient algorithm for low \textit{n}-rank tensor recovery
- Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Exact Tensor Completion Using t-SVD
- Fast Hankel tensor-vector product and its application to exponential data fitting.
- Fast Multilinear Singular Value Decomposition for Structured Tensors
- Frequency Domain Subspace Identification Using Nuclear Norm Minimization and Hankel Matrix Realizations
- Hankel Tensor Decompositions and Ranks
- Hankel tensors, Vandermonde tensors and their positivities
- Hankel tensors: associated Hankel matrices and Vandermonde decomposition
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- Symmetric Tensors and Symmetric Tensor Rank
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
Cited in
(1)
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)