Matrix Completion by the Principle of Parsimony

Abstract: Dempster's covariance selection method is extended first to general nonsingular matrices and then to full rank rectangular matrices. Dempster observed that his completion solved a maximum entropy problem. We show that our generalized completions are also solutions of a suitable entropy-like variational problem.

This page was built for publication: Matrix Completion by the Principle of Parsimony

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6219488)