307 search results - page 24 / 62 » The convex hull of ellipsoids |
CCCG
2006
13 years 9 months ago
2006
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
IPL
2008
13 years 7 months ago
2008
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
DAM
2007
13 years 7 months ago
2007
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
ICCAD
1993
IEEE
13 years 11 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
MP
2010
13 years 6 months ago
2010
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...