相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions
Xiaodong Li
CONSTRUCTIVE APPROXIMATION (2013)
User-Friendly Tail Bounds for Sums of Random Matrices
Joel A. Tropp
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2012)
Robust PCA via Outlier Pursuit
Huan Xu et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2012)
Robust Matrix Decomposition With Sparse Corruptions
Daniel Hsu et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2011)
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
David Gross
IEEE TRANSACTIONS ON INFORMATION THEORY (2011)
Robust Principal Component Analysis?
Emmanuel J. Candes et al.
JOURNAL OF THE ACM (2011)
Nuclear norm minimization for the planted clique and biclique problems
Brendan P. W. Ames et al.
MATHEMATICAL PROGRAMMING (2011)
RANK-SPARSITY INCOHERENCE FOR MATRIX DECOMPOSITION
Venkat Chandrasekaran et al.
SIAM JOURNAL ON OPTIMIZATION (2011)
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Emmanuel J. Candes et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2010)
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Benjamin Recht et al.
SIAM REVIEW (2010)
Exact Matrix Completion via Convex Optimization
Emmanuel J. Candes et al.
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2009)
Strong converse for identification via quantum channels
R Ahlswede et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2002)
Distance matrix completion by numerical optimization
MW Trosset
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2000)