Matrix Completion à la Dempster by the Principle of Parsimony

DOI10.1109/TIT.2011.2143970zbMath1365.15039OpenAlexW2107095576MaRDI QIDQ5273644

Michele Pavon, Augusto Ferrante

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2011.2143970

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Matrix completion problems (15A83)

Related Items

An efficient algorithm for maximum entropy extension of block-circulant covariance matrices ⋮ Geometric mean of partial positive definite matrices with missing entries ⋮ A variational derivation of a class of BFGS-like methods ⋮ A maximum entropy approach to the realizability of spin correlation matrices ⋮ Graphical model selection for a particular class of continuous-time processes