Is the following problem known? Suppose one is given some of the entries of an $n \times n$ matrix $A$ over $\mathbb{R}$, so that the given entries are symmetric. Can one assign values to the remaining entries so that the resulting matrix is positive definite?
Has this problem been studied from a theoretical or algorithmic point of view?