Abstract
Multisets are collections of elements which may appear with multiplicity. We review the multiplicity function and cardinality, and we introduce the notion of filter to extract the distinct elements in a multiset. We define a notion of outer limit for sequences of multisets, and we define and develop “multiset mappings” that take multisets to multisets. We introduce a generalized continuity property for multiset mappings (called calmness) that relies on choices of pre-distance functions, and we investigate how this property generalizes a similar property for set-valued mappings. We define a generalized derivative for multiset mappings and use it to characterize calmness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Knuth, D.E.: Seminumerical Algorithms. The Art of Computer Programming, vol. 2, 3rd edn. Addison-Wesley, Boston (1998)
Robinson, S.M.: Generalized equations and their solutions. I. Basic theory. In: Point-to-Set Maps and Mathematical Programming. Mathematical Programming Studies, vol. 10, pp. 128–141. Springer, Berlin (1979)
Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 The Author(s), under exclusive licence to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Levy, A.B. (2018). Multisets and Multiset Mappings. In: Attraction in Numerical Minimization. SpringerBriefs in Optimization. Springer, Cham. https://doi.org/10.1007/978-3-030-04049-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-04049-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04048-2
Online ISBN: 978-3-030-04049-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)