Abstract
During the last ten years a tendency of “organising” the wide range of convexity properties for sets and for functions appeared in the mathematical literature. For example, the great collection of P. M. Gruber and J. M. Willis (1993) refers to 21 types of convexity for various types of sets. I. Singer (1997) writes about 26 types of convexity for sets, trying to obtain a classification of them according to the principle of definition and of some properties. The thesis of J. M. Chassery (1984 [43]) refers to 6 types of discrete convexity properties. Our own book, G. Cristescu (2000 [71]), contains 19 notions of convexity for sets, trying to build a unifying theory of most of them. Other references and studies on more types of convexities or concavities for sets are in the books published or coordinated by S. Schaible (1981), M. Avriel et al. (1988) and V.P. Soltan (1984).
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Cristescu, G., Lupşa, L. (2002). Classification of the convexity properties. In: Non-Connected Convexities and Applications. Applied Optimization, vol 68. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0003-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0003-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4881-8
Online ISBN: 978-1-4615-0003-2
eBook Packages: Springer Book Archive