Abstract
This chapter summarizes the basic concepts and facts about convex sets. Affine sets, halfspaces, convex sets, convex cones are introduced, together with related concepts of dimension, relative interior and closure of a convex set, gauge and recession cone. Caratheodory’s Theorem and Shapley–Folkman’s Theorem are formulated and proven. The first and second separation theorems are presented and on this basis the geometric structure of a convex set is studied via its supporting hyperplanes, faces, and extreme points. Polars of convex sets and particularly of polyhedral convex sets are introduced and the basic theorem on representation of a polyhedron in terms of its extreme points and extreme directions is established. The chapter closes by a study of systems of convex sets, including a proof of Helly’s Theorem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic, New York (1970)
Thach, P.T., Konno, H.: On the degree and separability of nonconvexity and applications to optimization problems. Math. Program. 77, 23–47 (1996)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Tuy, H. (2016). Convex Sets. In: Convex Analysis and Global Optimization. Springer Optimization and Its Applications, vol 110. Springer, Cham. https://doi.org/10.1007/978-3-319-31484-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-31484-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31482-2
Online ISBN: 978-3-319-31484-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)