Abstract
A supremal generator of a set X of functions is a subset H of X such that each function from X is abstract convex with respect to H. In other words H is a supremal generator of X if each function from X can be represented as the upper envelope of a subset of H. As it turns out there exist very large sets with very small supremal generators. For example, the space of all lower semicontinuous functions defined on a segment of the real line has supremal generators, which are cones spanned by three functions only. If H is a supremal generator of a set of functions, then some properties of H allow one to study some properties of functions belonging to X. Properties of small supremal generators very often can be verified “manually”, that is by direct calculation. Thus the existence of small supremal generators is very helpful. In this chapter we first present a description of supremal generators for some sets of lower semicontinuous functions and then describe some small generators for these sets. We shall show that the description of supremal generators for the set of all lower semicontinuous functions is much easier than for proper subsets of this set.
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
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Rubinov, A. (2000). Supremal Generators and Their Applications. In: Abstract Convexity and Global Optimization. Nonconvex Optimization and Its Applications, vol 44. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3200-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3200-9_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4831-1
Online ISBN: 978-1-4757-3200-9
eBook Packages: Springer Book Archive