Kissing polytopes
DOI10.1137/24m1640859MaRDI QIDQ6622740
Sebastian Pokutta, Shmuel Onn, A. Deza, L. Pournin
Publication date: 22 October 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
alternating projectionslattice polytopesfacial distancedistances in geometric latticespyramidal widthvertex-facet distance
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Geometric constructions in real or complex geometry (51M15)
Cites Work
- Title not available (Why is that?)
- Mixed-integer quadratic programming is in NP
- Anti-Hadamard matrices
- Geometric algorithms and combinatorial optimization.
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- The condition number of a function relative to a set
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Quadratic programming is in NP
- The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
- Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
This page was built for publication: Kissing polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622740)
