Low Tucker rank tensor completion using a symmetric block coordinate descent method

DOI10.1002/NLA.2464OpenAlexW4293870373WikidataQ114235389 ScholiaQ114235389MaRDI QIDQ6133041FDOQ6133041

Liqun Qi, Quan Yu, Xinzhen Zhang, Yannan Chen

Publication date: 17 August 2023

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2464

zbMATH Keywords

sparsityblock coordinate descenttensor completiontruncated nuclear normTucker rank

Mathematics Subject Classification ID

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

Cited In (3)

• Generalized nonconvex hyperspectral anomaly detection via background representation learning with dictionary constraint
• T-product factorization based method for matrix and tensor completion problems
• Eigenvalues of quaternion tensors: properties, algorithms and applications

This page was built for publication: Low Tucker rank tensor completion using a symmetric block coordinate descent method

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