A rank-corrected procedure for matrix completion with fixed basis coefficients
Published 2015 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A rank-corrected procedure for matrix completion with fixed basis coefficients
Authors
Keywords
Matrix completion, Fixed basis coefficients, Low-rank, Convex optimization, Rank consistency, Constraint nondegeneracy, 90C90
Journal
MATHEMATICAL PROGRAMMING
Volume 159, Issue 1-2, Pages 289-338
Publisher
Springer Nature
Online
2015-10-30
DOI
10.1007/s10107-015-0961-7
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Noisy low-rank matrix completion with general sampling distribution
- (2014) Olga Klopp BERNOULLI
- Asymptotic equivalence of quantum state tomography and noisy matrix completion
- (2013) Yazhen Wang ANNALS OF STATISTICS
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- (2013) Maryam Fazel et al. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- (2013) Ming-Jun Lai et al. SIAM JOURNAL ON NUMERICAL ANALYSIS
- Von Neumann entropy penalization and low-rank matrix estimation
- (2012) Vladimir Koltchinskii ANNALS OF STATISTICS
- An introduction to a class of matrix cone programming
- (2012) Chao Ding et al. MATHEMATICAL PROGRAMMING
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- (2012) Steven T Flammia et al. NEW JOURNAL OF PHYSICS
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- (2012) Kaifeng Jiang et al. SIAM JOURNAL ON OPTIMIZATION
- Estimation of high-dimensional low-rank matrices
- (2011) Angelika Rohde et al. ANNALS OF STATISTICS
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- (2011) Vladimir Koltchinskii et al. ANNALS OF STATISTICS
- User-Friendly Tail Bounds for Sums of Random Matrices
- (2011) Joel A. Tropp FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- (2011) David Gross IEEE TRANSACTIONS ON INFORMATION THEORY
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- (2011) Massimo Fornasier et al. SIAM JOURNAL ON OPTIMIZATION
- Rank penalized estimators for high-dimensional matrices
- (2011) Olga Klopp Electronic Journal of Statistics
- Nearly unbiased variable selection under minimax concave penalty
- (2010) Cun-Hui Zhang ANNALS OF STATISTICS
- Matrix Completion From a Few Entries
- (2010) Raghunandan H. Keshavan et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- (2010) Emmanuel J. Candes et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- (2010) H. Qi et al. IMA JOURNAL OF NUMERICAL ANALYSIS
- Quantum State Tomography via Compressed Sensing
- (2010) David Gross et al. PHYSICAL REVIEW LETTERS
- Matrix Completion With Noise
- (2010) Emmanuel J Candes et al. PROCEEDINGS OF THE IEEE
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- (2010) Benjamin Recht et al. SIAM REVIEW
- Exact Matrix Completion via Convex Optimization
- (2009) Emmanuel J. Candès et al. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
- One-step sparse estimates in nonconcave penalized likelihood models
- (2008) Hui Zou et al. ANNALS OF STATISTICS
- Sure independence screening for ultrahigh dimensional feature space
- (2008) Jianqing Fan et al. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started