Abstract
A subset of a finite-dimensional real vector space is called evenly convex if it is the intersection of a collection of open halfspaces. The study of such sets was initiated in 1952 by Werner Fenchel, who defined a natural polarity operation and mentioned some of its properties. Over the years since then, evenly convex sets have made occasional appearances in the literature but there has been no systematic study of their basic properties. Such a study is undertaken in the present paper.
References
- E. Asplund: A k-extreme point is the limit of k-exposed points, Israel J. Math. 1 (1963) 161–162.https://doi.org/10.1007/BF02759703Google Scholar
- G. Choquet, H. Corson, V. Klee: Exposed points of convex sets, Pacific J. Math. 17 (1966) 33–43.https://doi.org/10.2140/pjm.1966.17.33Google Scholar
- H. Corson: A compact convex set in E 3 whose exposed points are of the first category, Proc. Amer. Math. Soc. 16 (1965) 1015–1021.https://doi.org/10.1090/S0002-9939-1965-0180917-5Google Scholar
- A. Daniilidis, J.-E. Martinez-Legaz: Characterizations of evenly convex sets and evenly quasiconvex functions, J. Math. Anal. Appl. 273 (2002) 58–66.https://doi.org/10.1016/S0022-247X(02)00206-8Google Scholar
- R. Durier: The Fermat-Weber problem and inner product spaces, J. Approximation Theory 78 (1994) 161–173.https://doi.org/10.1006/jath.1994.1070Google Scholar
- W. Fenchel: A remark on convex sets and polarity, Comm. Sém. Math. Univ. Lund (Medd. Lunds Univ. Math. Sem.), Tome Supplémentaire (1952) 82–89.Google Scholar
- M. A. Goberna, V. Jornet, M. Rodríguez: On linear systems containing strict inequalities, Linear Algebra Appl. 360 (2003) 151–171.https://doi.org/10.1016/S0024-3795(02)00445-7Google Scholar
- V. Klee: Extremal structure of convex sets. II., Math. Zeitschr. 69 (1958) 90–104.https://doi.org/10.1007/BF01187394Google Scholar
- V. Klee: Some characterizations of convex polyhedra, Acta Math. 102 (1959) 80–107.https://doi.org/10.1007/BF02559569Google Scholar
- V. Klee: Maximal separation theorems for convex sets, Trans. Amer. Math. Soc. 134 (1968) 133–147.https://doi.org/10.1090/S0002-9947-1968-0235457-9Google Scholar
- V. Klee: Adjoints of projective transformations and face-figures of convex polytopes, Math. Program. Study 8 (1978) 208–216.https://doi.org/10.1007/BFb0121203Google Scholar
- V. Klee: Sharper approximation of extreme points by far points, Archiv Math. 60 (1993) 383–388.https://doi.org/10.1007/BF01207196Google Scholar
- J.-E. Martinez-Legaz: A generalized concept of conjugation, in: Optimization, Theory and Algorithms, J.-B. Hiriart-Urruty, W. Oettli, J. Stoer (eds.), Lect. Notes Pure Appl. Math. 86, Marcel Dekker, New York (1983) 45–59.Google Scholar
- U. Passy, E. Z. Prisman: Conjugacy in quasiconvex programming, Math. Programming 30 (1984) 121–146.https://doi.org/10.1007/BF02591881Google Scholar
- J.-P. Penot, M. Volle: On quasiconvex duality, Math. Oper. Res. 15 (1990) 597–625.https://doi.org/10.1287/moor.15.4.597Google Scholar
- R. T. Rockafellar: Monotropic Programming and Network Optimization, Wiley-Interscience, New York (1984).Google Scholar
- J. Schröder: Range-domain implications for linear operators, SIAM J. Appl. Math. 19 (1970) 235–242.https://doi.org/10.1137/0119022Google Scholar
- J. Schröder: Duality in linear range-domain implications, in: Inequalities III, O. Shisha (ed.), Academic Press, New York (1972) 321–332.Google Scholar
- S. Straszewicz: Über exponierte Punkte abgeschlossener Punktmengen, Fund. Math. 24 (1935) 139–143.https://doi.org/10.4064/fm-24-1-139-143Google Scholar
Suggested citation
Published by Heldermann Verlag, 2007. Rights now held by Banach Press LLC.
