April 02, 2009 article Open access Exact Matrix Completion via Convex Optimization Foundations of Computational Mathematics DOI: 10.1007/s10208-009-9045-5 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 5,136 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Asymptotic Log-Det Rank Minimization via (Alternating) Iteratively Reweighted Least Squares 2021 arXiv (Cornell University) preprint Engineering Sparse and Compressive Sensing Techniques Open access 1 citations Tensor theta norms and low rank recovery 2020 Numerical Algorithms article Engineering Sparse and Compressive Sensing Techniques Open access 17 citations Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements 2020 Applied Mathematics and Computation article Engineering Sparse and Compressive Sensing Techniques Open access 5 citations DreamAI: algorithm for the imputation of proteomics data 2020 bioRxiv (Cold Spring Harbor Laboratory) preprint Chemistry Advanced Proteomics Techniques and Applications Open access 56 citations 4 results References 0