An iterative algorithm for low-rank tensor completion problem with sparse noise and missing values.

DOI10.1002/NLA.2544MaRDI QIDQ6584474zbMATH OpenFDO

Authors Jianheng Chen, Wen Huang

Publication date 7 August 2024

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

zbMATH Keywords

missing valueslow-rank tensor completionblock coordinate descentsparse noisetransformed multi-rank manifold

Mathematics Subject Classification ID

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

Cited in

(1)

• Incremental quaternion singular value decomposition and its application for low rank quaternion matrix completion

This page was built for publication: An iterative algorithm for low-rank tensor completion problem with sparse noise and missing values.

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