Hybrid Singular Value Thresholding for Tensor Completion
暂无分享,去创建一个
Xiaoqin Zhang | Yi Ma | Zhengyuan Zhou | Di Wang | Zhengyuan Zhou | Xiaoqin Zhang | Yi Ma | Di Wang
[1] Ryota Tomioka,et al. Estimation of low-rank tensors via convex optimization , 2010, 1010.0789.
[2] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[3] B. Recht,et al. Tensor completion and low-n-rank tensor recovery via convex optimization , 2011 .
[4] J. Suykens,et al. Nuclear Norms for Tensors and Their Use for Convex Multilinear Estimation , 2011 .
[5] Yi Ma,et al. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.
[6] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[7] Bo Huang,et al. Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery , 2013, ICML.
[8] Pablo A. Parrilo,et al. Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..
[9] Yi Ma,et al. Compressive principal component pursuit , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[10] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[11] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[12] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[13] J. Kruskal. Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics , 1977 .
[14] Jieping Ye,et al. Tensor Completion for Estimating Missing Values in Visual Data , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[15] David Gross,et al. Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.
[16] Shiqian Ma,et al. Alternating Proximal Gradient Method for Convex Minimization , 2015, Journal of Scientific Computing.
[17] Andrea Montanari,et al. Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.
[18] Xiaodong Li,et al. Stable Principal Component Pursuit , 2010, 2010 IEEE International Symposium on Information Theory.
[19] G. Sapiro,et al. A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.
[20] Arvind Ganesh,et al. Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix , 2009 .
[21] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[22] Yonina C. Eldar,et al. Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices , 2012, IEEE Transactions on Information Theory.
[23] Xuelong Li,et al. Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[25] John Wright,et al. Principal Component Pursuit with reduced linear measurements , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[26] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..