A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes.
Menelaos I. KaravelasEleni TzanakiPublished in: CoRR (2015)
Keyphrases
- upper bound
- convex hull
- lower bound
- minkowski sum
- worst case
- branch and bound algorithm
- convex polyhedra
- lower and upper bounds
- knn
- convex optimization
- error probability
- distance transform
- strictly convex
- sample complexity
- piecewise linear
- mathematical morphology
- branch and bound
- feasible solution
- convex sets
- von neumann
- lattice points
- random variables
- convex constraints
- globally optimal
- interactive theorem proving
- digital topology
- empirical risk
- extreme points
- risk minimization
- convex relaxation
- geometric properties
- np hard