Computational methods for cones and polytopes with symmetry
M. Dutour
Abstract
Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several methods which allow us to use symmetries for the computation of extreme rays and facets of cones. I give an algorithm for computing adjacencies using a linear programming approach. I give a complete description of the method of incidence, adjacency decomposition method and of the subcone method used for computing with symmetric cones.
Create a lesson
Related papers
The Bézout inequality for mixed volumes characterizes simplices
Dylan Langharst, Shouda Wang
Affine dual Minkowski problem for general measures
Cheng Zhang, Hailin Jin
Algebraically independent distances and rigid metrics
Yoshito Ishiki
On the Geometry of Wasserstein Barycenter II: Riemannian Rigidity, Essential Non-Branching, and Finsler Models
Bang-Xian Han, Deng-Yu Liu
A Weak Topology on Metric Spaces
Armando W. Gutiérrez, Olavi Nevanlinna
Uncentered Blaschke-Santaló inequalities for the Gaussian measure
S. Artstein-Avidan, M. Fradelizi, K. Wyczesany