in a matrix completion problem, one has access to a subset of entries of a matrix and wishes to determine the missing entries subject to some constraint (e.g. a rank bound). such problems appear in computer vision, collaborative filtering, and many other applications. in this talk, i will discuss how certain notions from nonlinear algebra can be used to understand the structure underlying various types of matrix completion problems.