A rank-corrected procedure for matrix completion with fixed basis coefficients

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

Ask authors/readers for more resources

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started