Abstract
Let X be a convex subset of a vector space V. We say that \(f : X\rightarrow \mathbb{R}\) is convex if for all x, y ε X and λ ε (0, 1) we have
If the inequality is strict when x≠y, then we say that f is strictly convex. In this chapter we aim to look at some properties of these functions, in particular, when E is a normed vector space. For differentiable functions we will obtain a characterization, which will enable us to generalize the concept of a convex function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barvinok, A.: A Course in Convexity. American Mathematical Society, Providence, RI (2002)
Borwein, J., Lewis, A.S.: Convex Analysis and Nonlinear Optimization, 2nd edn. Canadian Mathematical Society, Vancouver BC (2006)
Grünbaum, G., Ziegler, G.: Convex Polytopes, 2nd edn. Springer-Verlag, Berlin (2003)
Rudin, W.: Functional Analysis. McGraw-Hill, New York (1991)
Schneider, R.: Convex Bodies: The Brunn-Minkowski Theory. Cambridge University Press, Cambridge (1993)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media New York
About this chapter
Cite this chapter
Coleman, R. (2012). Convex Functions. In: Calculus on Normed Vector Spaces. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3894-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3894-6_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-3893-9
Online ISBN: 978-1-4614-3894-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)