Abstract
Minimal pairs of compact convex sets can be constructed by decomposing a given compact convex set. The decomposition can be performed in two different ways. One way is to determine nontrivial summands, another way is to divide the convex set by a hyperplane into two nonempty convex subsets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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
Pallaschke, D., Urbański, R. (2002). Decompositions. In: Pairs of Compact Convex Sets. Mathematics and Its Applications, vol 548. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9920-7_8
Download citation
DOI: https://doi.org/10.1007/978-94-015-9920-7_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6149-2
Online ISBN: 978-94-015-9920-7
eBook Packages: Springer Book Archive