Topics in Convexity

Part of the Graduate Texts in Mathematics book series (GTM, volume 258)


In this chapter, we probe several topics that use significant ideas from convexity theory and that have significant applications in various fields. In particular, we prove theorems of Radon, Helly, Kirchberger, Bárány, and Tverberg on the combinatorial structure of convex sets, application of Helly’s theorem to semi-infinite programming, in particular to Chebyshev’s approximation problem, homogeneous convex functions, and their applications to inequalities, attainment of optima in maximization of convex functions, decompositions of convex cones, and finally the relationship between the norms of a homogeneous polynomial and its associated symmetric form. The last result has an immediate application to self-concordant functions in interior-point algorithms.


Convex Function Convex Hull Convex Body Convex Cone Minimax Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer New York 2010

Authors and Affiliations

  1. 1.Department of Mathematics & StatisticsUniversity of MarylandBaltimoreUSA

Personalised recommendations