Matrix Completion With Deterministic Pattern: A Geometric Perspective

DOI10.1109/TSP.2018.2885494zbMath1414.15034arXiv1802.00047WikidataQ128771885 ScholiaQ128771885MaRDI QIDQ4628264

Alexander Shapiro, Rui Zhang, Yao Xie

Publication date: 6 March 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.00047

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Matrix completion problems (15A83)

Related Items

Bayesian uncertainty quantification for low-rank matrix completion ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization