Preprint
Abstract
We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal distance between such polytopes appears in complexity bounds of optimization algorithms. We provide nearly matching lower and upper bounds on this distance and discuss its exact computation. We also give similar bounds in the case of disjoint rational polytopes whose binary encoding length is prescribed.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Conditional Gradient Methods2025
- Polytope Conditioning and Linear Convergence of the Frank–Wolfe AlgorithmMathematics of Operations Research, 2018
- Linearly convergent away-step conditional gradient for non-strongly convex functionsMathematical Programming, 2016
- Mixed-integer quadratic programming is in NPMathematical Programming, 2016
- Quadratic programming is in NPInformation Processing Letters, 1990