|
This article is cited in 4 scientific papers (total in 4 papers)
Partial Convexity
V. G. Naidenko Institute of Mathematics, National Academy of Sciences of the Republic of Belarus
Abstract:
We study $OC$-convexity, which is defined by the intersection of conic semispaces of partial convexity. We investigate an optimization problem for $OC$-convex sets and prove a Krein–Milman type theorem for $OC$-convexity. The relationship between $OC$-convex and functionally convex sets is studied. Topological and numerical aspects, as well as separability properties are described. An upper estimate for the Carathéodory number for $OC$-convexity is found. On the other hand, it happens that the Helly and the Radon number for $OC$-convexity are infinite. We prove that the $OC$-convex hull of any finite set of points is the union of finitely many polyhedra.
Received: 12.07.2002
Citation:
V. G. Naidenko, “Partial Convexity”, Mat. Zametki, 75:2 (2004), 222–235; Math. Notes, 75:2 (2004), 202–212
Linking options:
https://www.mathnet.ru/eng/mzm29https://doi.org/10.4213/mzm29 https://www.mathnet.ru/eng/mzm/v75/i2/p222
|
Statistics & downloads: |
Abstract page: | 341 | Full-text PDF : | 184 | References: | 32 | First page: | 1 |
|