Optimal tuning-free convex relaxation for noisy matrix completion

DOI10.1109/TIT.2023.3284341MaRDI QIDQ6574989zbMATH OpenFDO

Authors Yuepeng Yang, Cong Ma

Publication date 19 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2023.3284341

zbMATH Keywords

noisy matrix completiontuning-free square-root matrix completion estimator

Mathematics Subject Classification ID

Matrix completion problems (15A83) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(1)

• Dynamic mode decomposition via difference-of-convex principal component analysis

This page was built for publication: Optimal tuning-free convex relaxation for noisy matrix completion

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