zbMATH — the first resource for mathematics

The power of convex relaxation: near-optimal matrix completion. (English) Zbl 1366.15021
Editorial remark: No review copy delivered.

15A83 Matrix completion problems
60B20 Random matrices (probabilistic aspects)
90C22 Semidefinite programming
90C46 Optimality conditions and duality in mathematical programming
94A12 Signal theory (characterization, reconstruction, filtering, etc.)
PDF BibTeX Cite
Full Text: DOI