An accelerated stochastic proximal gradient algorithm for low rank tensor completion

DOI10.12286/JSSX.J2021-0809MaRDI QIDQ6665175

Xiong-Wei Guo, Chuanlong Wang

Publication date: 17 January 2025

Published in: Mathematica Numerica Sinica (Search for Journal in Brave)

zbMATH Keywords

tensor completionaccelerated proximal gradient algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Multilinear algebra, tensor calculus (15A69)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The expression of a tensor or a polyadic as a sum of products.
• Learning with tensors: a framework based on convex optimization and spectral regularization
• A non-convex tensor rank approximation for tensor completion
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Nuclear norm of higher-order tensors

This page was built for publication: An accelerated stochastic proximal gradient algorithm for low rank tensor completion

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