Centerpoints: A Link between Optimization and Convex Geometry
From MaRDI portal
Publication:5737732
DOI10.1137/16M1092908zbMath1406.52013OpenAlexW2612240805MaRDI QIDQ5737732
Publication date: 30 May 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1092908
Convex programming (90C25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mixed integer programming (90C11) Helly-type theorems and geometric transversal theory (52A35)
Related Items (7)
Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice ⋮ Minimization of even conic functions on the two-dimensional integral lattice ⋮ Information complexity of mixed-integer convex optimization ⋮ A polynomial algorithm for minimizing discrete convic functions in fixed dimension ⋮ On the complexity of quasiconvex integer minimization problem ⋮ Complexity of optimizing over the integers ⋮ Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measures of symmetry for convex sets and stability
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Solving systems of polynomial inequalities in subexponential time
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Geometric algorithms and combinatorial optimization
- Sharper bounds for Gaussian and empirical processes
- Introductory lectures on convex optimization. A basic course.
- Exact computation of the halfspace depth
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- Integer convex minimization by mixed integer linear optimization
- The Tukey depth characterizes the atomic measure
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- Complexity of integer quasiconvex polynomial optimization
- On the symmetry function of a convex set
- Cut-Generating Functions for Integer Variables
- On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Transversal numbers over subsets of linear spaces
- A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
- Integer Programming with a Fixed Number of Variables
- Centerpoints: A Link Between Optimization and Convex Geometry
- On the Mixed Binary Representability of Ellipsoidal Regions
- Minkowski's Convex Body Theorem and Integer Programming
- On 64%-Majority Rule
- On the combinatorial and algebraic complexity of quantifier elimination
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
- INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY
- Cut-Generating Functions and S-Free Sets
- Convex and Discrete Geometry
- Robustness and Complex Data Structures
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Solving convex programs by random walks
- The depth function of a population distribution.
This page was built for publication: Centerpoints: A Link between Optimization and Convex Geometry
