After preconditioning the defining linear map, global minimization of the dual log-partition function certifies moment body membership, and L-BFGS handles dense n=m=1000 instances in seconds.
The convex algebraic geometry of higher-rank numerical ranges
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex geometry of these sets, including a generalization of Kippenhahn's theorem, and describe an algorithm to explicitly calculate the higher-rank numerical range of a given matrix.
citation-role summary
other 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Maximal entropy in the moment body
After preconditioning the defining linear map, global minimization of the dual log-partition function certifies moment body membership, and L-BFGS handles dense n=m=1000 instances in seconds.