Iterative algorithm for the symmetric and nonnegative tensor completion problem

DOI10.1080/03081087.2018.1461797zbMath1417.65135OpenAlexW2802928875WikidataQ115006273 ScholiaQ115006273MaRDI QIDQ4967254

Qing-Wen Wang, Jianheng Chen, Xue-Feng Duan, Chun-Mei Li

Publication date: 3 July 2019

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1461797

zbMATH Keywords

alternating direction methodtensor completionsymmetric and nonnegative tensor

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Matrix completion problems (15A83)

Cites Work

• Parallel matrix factorization for low-rank tensor completion
• Symmetric nonnegative tensors and copositive tensors
• Low-rank tensor completion by Riemannian optimization
• Tensor completion using total variation and low-rank matrix factorization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Optimal Joint Diagonalization of Complex Symmetric Third-Order Tensors. Application to Separation of Non Circular Signals
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• On the low rank solution of the Q‐weighted nearest correlation matrix problem