Abstract
Convexity is an important part of optimization, and we devote several chapters to various aspects of it in this book. This chapter treats the most basic properties of convex sets and functions, while Chapter 5 is devoted to their deeper properties, such as the relative interior (both in the algebraic and topological senses) and boundary structure of convex sets, the continuity properties of convex functions, and homogenization of convex sets. Chapter 6 treats the separation properties of convex sets, a very important topic in optimization. The calculus of the relative interior of convex sets developed in Chapter 5 plays an important role here. Chapters 7 and 8 deal with two, related, special topics, the theory of convex polyhedra and the theory of linear programming, respectively. Both are important topics within optimization, and each has wide applicability within science, engineering, and technology. Many developments in optimization have in fact been inspired by linear programming. Finally, Chapter 13 investigates several special topics in convexity.
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer New York
About this chapter
Cite this chapter
Güler, O. (2010). Convex Analysis. In: Foundations of Optimization. Graduate Texts in Mathematics, vol 258. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68407-9_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-68407-9_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-34431-7
Online ISBN: 978-0-387-68407-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)