Abstract:
We study OCOC-convexity, which is defined by the intersection of conic semispaces of partial convexity. We investigate an optimization problem for OCOC-convex sets and prove a Krein–Milman type theorem for OCOC-convexity. The relationship between OCOC-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 OCOC-convexity is found. On the other hand, it happens that the Helly and the Radon number for OCOC-convexity are infinite. We prove that the OCOC-convex hull of any finite set of points is the union of finitely many polyhedra.
This publication is cited in the following 5 articles:
David Flores-Peñaloza, Mario A. Lopez, Nestaly Marín, David Orden, “An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets”, Information Processing Letters, 189 (2025), 106551
V. G. Naidenko, “Topology of directional convexity”, Vescì Akademìì navuk Belarusì. Seryâ fizika-matematyčnyh navuk, 56:4 (2020), 408
A. M. Dulliev, “Properties of Connected Ortho-convex Sets in the Plane”, Math. Notes, 101:3 (2017), 443–459
A. M. Dulliev, “Two Structures Based on Convexities on the 2-Sphere”, Math. Notes, 102:2 (2017), 156–163
V. G. Naidenko, “Contractibility of Half-Spaces of Partial Convexity”, Math. Notes, 85:6 (2009), 868–876