985 search results - page 2 / 197 » Piercing Convex Sets |
IWCIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We propose definitions of digital convex sets and digital convex functions and relate them to a refined definition of digital hyperplanes.
CORR
2010
Springer
13 years 1 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
SIAMDM
2011
13 years 5 days ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
OL
2010
13 years 3 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...
FOCM
2010
13 years 3 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...