Centerpoints: A Link between Optimization and Convex Geometry (Q5737732)

scientific article; zbMATH DE number 6724133

Language	Label	Description	Also known as
English	Centerpoints: A Link between Optimization and Convex Geometry	scientific article; zbMATH DE number 6724133

Statements

instance of

scholarly article

0 references

title

Centerpoints: A Link between Optimization and Convex Geometry (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

30 May 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

convex mixed-integer optimization

0 references

centerpoints

0 references

convex and discrete geometry

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets

0 references

Transversal numbers over subsets of linear spaces

0 references

INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY

0 references

Centerpoints: A Link Between Optimization and Convex Geometry

0 references

On the combinatorial and algebraic complexity of quantifier elimination

0 references

On the symmetry function of a convex set

0 references

Solving convex programs by random walks

0 references

COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON

0 references

On 64%-Majority Rule

0 references

Q5501289

0 references

Cut-Generating Functions and <i>S</i>-Free Sets

0 references

A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming

0 references

Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization

0 references

Helly numbers of algebraic subsets of $\mathbb{R}^{d}$ and an extension of Doignon's theorem

0 references

On the Mixed Binary Representability of Ellipsoidal Regions

0 references

Breakdown properties of location estimates based on halfspace depth and projected outlyingness

0 references

Exact computation of the halfspace depth

0 references

Solving systems of polynomial inequalities in subexponential time

0 references

Geometric algorithms and combinatorial optimization

0 references

Convex and Discrete Geometry

0 references

Partitions of mass-distributions and of convex bodies by hyperplanes

0 references

Q5517554

0 references

Complexity of integer quasiconvex polynomial optimization

0 references

A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity $2^{O(n\log n)}$

0 references

Q3951161

0 references

Minkowski's Convex Body Theorem and Integer Programming

0 references

The Tukey depth characterizes the atomic measure

0 references

Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice

0 references

Integer Programming with a Fixed Number of Variables

0 references

Q3413937

0 references

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

0 references

Robustness and Complex Data Structures

0 references

Q3967358

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Integer convex minimization by mixed integer linear optimization

0 references

Q4789202

0 references

The depth function of a population distribution.

0 references

Sharper bounds for Gaussian and empirical processes

0 references

Measures of symmetry for convex sets and stability

0 references

Q4117205

0 references

On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

0 references

Q2908836

0 references

Q3593486

0 references

Cut-Generating Functions for Integer Variables

0 references

full work available at URL

https://doi.org/10.1137/16m1092908

0 references

OpenAlex ID

W2612240805

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5737732