An efficient algorithm for the symmetric principal minor assignment problem

DOI10.1016/j.laa.2014.04.019zbMath1314.65050OpenAlexW2142623632MaRDI QIDQ2341884

Alex Kulesza, Justin Rising, Ben Taskar

Publication date: 6 May 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.04.019

zbMATH Keywords

principal minor assignment problem

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Iterative numerical methods for linear systems (65F10)

Related Items (6)

Characterizing principal minors of symmetric matrices via determinantal multiaffine polynomials ⋮ On a few statistical applications of determinantal point processes ⋮ Symmetrization of principal minors and cycle-sums ⋮ Principal minor assignment, isometries of Hilbert spaces, volumes of parallelepipeds and rescaling of sesqui-holomorphic functions ⋮ Skew-symmetric matrices and their principal minors ⋮ Determinantal Point Processes for Image Processing

Cites Work

• Set-theoretic defining equations of the variety of principal minors of symmetric matrices
• Principal minors. I: A method for computing all the principal minors of a matrix
• Principal minors. II: The principal minor assignment problem
• Determinantal processes and independence
• Matrices diagonally similar to a symmetric matrix
• Hyperdeterminantal relations among symmetric principal minors
• Determinantal Point Processes for Machine Learning
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for the symmetric principal minor assignment problem