Geodesic
Partial Convexity
Matematičeskie zametki, Tome 75 (2004) no. 2, pp. 222-235.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{MZM_2004_75_2_a5,
     author = {V. G. Naidenko},
     title = {Partial {Convexity}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {222--235},
     publisher = {mathdoc},
     volume = {75},
     number = {2},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2004_75_2_a5/}
}
TY  - JOUR
AU  - V. G. Naidenko
TI  - Partial Convexity
JO  - Matematičeskie zametki
PY  - 2004
SP  - 222
EP  - 235
VL  - 75
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2004_75_2_a5/
LA  - ru
ID  - MZM_2004_75_2_a5
ER  - 
%0 Journal Article
%A V. G. Naidenko
%T Partial Convexity
%J Matematičeskie zametki
%D 2004
%P 222-235
%V 75
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2004_75_2_a5/
%G ru
%F MZM_2004_75_2_a5
V. G. Naidenko. Partial Convexity. Matematičeskie zametki, Tome 75 (2004) no. 2, pp. 222-235. http://geodesic.mathdoc.fr/item/MZM_2004_75_2_a5/

[1] Rawlins G., Wood D., “Ortho-convexity and its generalizations”, Computational Morphology, eds. Toussaint G. T, North-Holland, Amsterdam, 1988, 137–152 | MR

[2] Metelskii N. N., Naidenko V. G., “Chastichno vypuklye obolochki v prostranstve $\bbR^n$”, Vestsi NAN Belarusi. Ser. fiz.-matem. navuk, 1999, no. 4, 47–52 | MR

[3] Soltan V. P., Vvedenie v aksiomaticheskuyu teoriyu vypuklosti, Shtiintsa, Kishinev, 1984 | MR | Zbl

[4] Metelskii N. N., Naidenko V. G., “Algoritmicheskie aspekty chastichnoi vypuklosti”, Matem. zametki, 68:3 (2000), 399–410 | MR

[5] Metelskii N. N., Naidenko V. G., “Ob odnom klasse semiprostranstv chastichnoi vypuklosti”, Vestsi NAN Belarusi. Ser. fiz.-matem. navuk, 2000, no. 1, 56–59 | MR

[6] Naidenko V. G., “Directionally convex set and its application to an optimization problem”, Proc. Int. Workshop “Discrete Optimization Methods in Scheduling and Computer-Aided Design” (Minsk, Republic of Belarus, September 5–6, 2000), Institute of Engineering Cybernetics, Minsk, 2000, 159–161

[7] Klee V. L., “The structure of semispaces”, Math. Scand., 4 (1956), 54–64 | MR | Zbl

[8] Matoušek J., “On directional convexity”, Discrete Comput. Geom., 2001, 389–403 | MR | Zbl

[9] Matoušek J., Plechac P., “On functional separately convex hulls”, Discrete Comput. Geom., 1998, 105–130 | MR | Zbl

[10] Leikhtveis K., Vypuklye mnozhestva, Nauka, M., 1985 | MR