On Characteristic Rank for Matrix and Tensor Completion [Lecture Notes]
暂无分享,去创建一个
[1] E. B. Wilson,et al. The Resolution of Six Tests into Three General Factors. , 1939, Proceedings of the National Academy of Sciences of the United States of America.
[2] W. Rudin. Principles of mathematical analysis , 1964 .
[3] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .
[4] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[5] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[6] Lieven De Lathauwer,et al. Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(Lr, Lr, 1) Terms, and a New Generalization , 2013, SIAM J. Optim..
[7] Nikos D. Sidiropoulos,et al. Tensor Decomposition for Signal Processing and Machine Learning , 2016, IEEE Transactions on Signal Processing.
[8] Alexander Shapiro,et al. Matrix Completion With Deterministic Pattern: A Geometric Perspective , 2018, IEEE Transactions on Signal Processing.
[9] A. Shapiro,et al. Goodness-offit tests on manifolds , 2019 .
[10] Mohit Singh,et al. Rank one tensor completion problem , 2020, ArXiv.