The Power of Convex Relaxation: Near-Optimal Matrix Completion - Peeref

标题

The Power of Convex Relaxation: Near-Optimal Matrix Completion

作者

关键词

-

出版物

IEEE TRANSACTIONS ON INFORMATION THEORY

Volume 56, Issue 5, Pages 2053-2080

出版商

Institute of Electrical and Electronics Engineers (IEEE)

发表日期

2010-04-27

DOI

10.1109/tit.2010.2044061

参考文献

查看 2 条相关文献

向作者/读者发起求助以获取更多资源

Protocol

Reagent

Reprint

Find Funding. Review Successful Grants.

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

Explore

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

© Peeref 2019-2024. All rights reserved.