☆
4.6
Article
Exploiting sparsity in semidefinite programming via matrix completion I: General framework
SIAM JOURNAL ON OPTIMIZATION (2001)
Rate this paper
The primary rating indicates the level of overall quality for the paper. Secondary ratings independently reflect strengths or weaknesses of the paper.
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started