An efficient algorithm for the symmetric principal minor assignment problem

Linear Algebra and Its Applications - Tập 473 - Trang 126-144 - 2015
Justin Rising1, Alex Kulesza2, Ben Taskar3
1Department of Statistics, University of Pennsylvania, Philadelphia, PA 19104 USA
2Computer Science and Engineering, University of Michigan, Ann Arbor, MI 48109, USA
3Computer Science and Engineering, University of Washington, Seattle, WA 98195, USA

Tài liệu tham khảo

Borodin, 2011, Determinantal point processes, 231 Engel, 1980, Matrices diagonally similar to a symmetric matrix, Linear Algebra Appl., 29, 131, 10.1016/0024-3795(80)90234-7 Engeln-Müllges, 1996 Griffin, 2006, Principal minors, part I: a method for computing all the principal minors of a matrix, Linear Algebra Appl., 419, 107, 10.1016/j.laa.2006.04.008 Griffin, 2006, Principal minors, part II: the principal minor assignment problem, Linear Algebra Appl., 419, 125, 10.1016/j.laa.2006.04.009 Hassibi, 2007, On a construction of entropic vectors using lattice-generated distributions, 501 Holtz, 2007, Hyperdeterminantal relations among symmetric principal minors, J. Algebra, 316, 634, 10.1016/j.jalgebra.2007.01.039 Hough, 2006, Determinantal processes and independence, Probab. Surv., 3, 206, 10.1214/154957806000000078 Kulesza, 2012, Determinantal point processes for machine learning, Found. Trends Mach. Learn., 5, 123, 10.1561/2200000044 Oeding, 2011, Set theoretic defining equations of the variety of principal minors of symmetric matrices, Algebra Number Theory, 5, 75, 10.2140/ant.2011.5.75