478 search results - page 1 / 96 » Convexity minimizes pseudo-triangulations |
SIAMDM
2010
13 years 1 months ago
2010
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
DCG
2000
13 years 6 months ago
2000
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.
SIAMJO
2000
13 years 6 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
OL
2010
13 years 5 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
JMLR
2010
13 years 1 months ago
2010
In this paper, we investigate the problem of binary classification with a reject option in which one can withhold the decision of classifying an observation at a cost lower than t...