A linear optimization oracle for zonotope computation

DOI10.1016/j.comgeo.2021.101809zbMath1479.52035arXiv1912.02439OpenAlexW3182641525MaRDI QIDQ824329

Lionel Pournin, Antoine Deza

Publication date: 15 December 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.02439

zbMATH Keywords

Minkowski sumshyperplane arrangementsoptimization algorithmsenumeration algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items

Computing characteristic polynomials of hyperplane arrangements with symmetries

Cites Work

• Unnamed Item
• Primitive zonotopes
• Indecomposable polytopes
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Geometric algorithms and combinatorial optimization.
• How good are convex hull algorithms?
• Pivot versus interior point methods: Pros and cons
• Reverse search for enumeration
• Root cones and the resonance arrangement
• Convex integer optimization by constantly many linear counterparts
• Decomposability of polytopes
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Aperiodic Tilings, Positive Scalar Curvature, and Amenability of Spaces
• Diameter, Decomposability, and Minkowski Sums of Polytopes
• Indecomposable Polytopes
• Decomposable convex polyhedra