Matrix completion has been studied both in passive and active setting.
One of the earliest works in this space has been done in the space of collaborative filtering has been done in [1]}.
Later, many works has been done in the convex optimization and optimization relaxations space as well.
Many research papers has investigated this methodology by various mathematicians [2]}, [3]}, [4]} and nuclear norm minimization set a standard how to approach to this kind of problems.
