ABSTRACT
A partial matrix is a rectangular array of numbers in which some entries are specified while others are free to be chosen. A completion of a partial matrix is a specific choice of values for the unspecified entries. A matrix completion problem asks whether a partial matrix (or family of partial matrices with a given pattern of specified entries) has a completion of a specific type, such as a positive definite matrix. In some cases, a “best” completion is sought.
