| We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an m×n rank r matrix from p<mn number of linear measurements. The algorithms are first interpreted as the iterative hard thresholding algorithms with subspace projections.... |
南方科技大学数学系微信公众号
© 2015 All Rights Reserved. 粤ICP备14051456号
Address: No 1088,xueyuan Rd., Xili, Nanshan District,Shenzhen,Guangdong,China 518055 Tel: +86-755-8801 0000