CONVEX FUNCTION
In mathematics, a real-valued function ''f'' defined on an interval (or on any convex subset of some vector space) is called 'convex', or 'concave up', if for any two points ''x'' and ''y'' in its domain ''C'' and any ''t'' in [0,1], we have
:
In other words, a function is convex if and only if its epigraph (the set of points lying on or above the graph) is a convex set.
A function is called 'strictly convex' if
:
for any ''t'' in (0,1) and
A function is said to be concave if is convex.

A convex function ''f'' defined on some open interval ''C'' is continuous on ''C'' and differentiable at all but at most countably many points. If ''C'' is closed, then ''f'' may fail to be continuous at the endpoints of ''C''.
A continuous function on an interval ''C'' is convex if and only if
:
for all ''x'' and ''y'' in ''C''.
A differentiable function of one variable is convex on an interval if and only if its derivative is monotonically non-decreasing on that interval.
A continuously differentiable function of one variable is convex on an interval if and only if the function lies above all of its tangents: ''f''(''y'') ≥ ''f''(''x'') + ''f'(''x'') (''y'' − ''x'') for all ''x'' and ''y'' in the interval.
A twice differentiable function of one variable is convex on an interval if and only if its second derivative is non-negative there; this gives a practical test for convexity.
If its second derivative is positive then it is strictly convex, but the converse does not hold, as shown by ''f''(''x'') = ''x''4.
More generally, a continuous, twice differentiable function of several variables is convex on a convex set if and only if its Hessian matrix is positive semidefinite on the interior of the convex set.
Any local minimum of a convex function is also a global minimum. A ''strictly'' convex function will have at most one global minimum.
For a convex function ''f'', the sublevel sets {''x'' | ''f''(''x'') < ''a''} and {''x'' | ''f''(''x'') ≤ ''a''} with ''a'' ∈ 'R' are convex sets. However, a function whose sublevel sets are convex sets may fail to be a convex function; such a function is called a ''quasiconvex function''.
Jensen's inequality applies to all convex functions. If is random, taking values in some domain , then
★ If and are convex functions, then so are and
★ Convexity is invariant under affine maps: that is, if is convex with , then so is , where
★ If is convex in and is a convex nonempty set, then is convex in provided for some
★ The second derivative of ''x''2 is 2; it follows that ''x''2 is a convex function of ''x''.
★ The absolute value function |''x''| is convex, even though it does not have a derivative at ''x'' = 0.
★ The function ''f'' with domain [0,1] defined by ''f''(0)=''f''(1)=1, ''f''(''x'')=0 for 0<''x''<1 is convex; it is continuous on the open interval (0,1), but not continuous at 0 and 1.
★ The function ''x''3 has second derivative 6''x''; thus it is convex for ''x'' ≥ 0 and concave for ''x'' ≤ 0.
★ Every linear transformation to is convex but not strictly convex, since if ''f'' is linear, then This statement still holds if we replace "convex" by "concave".
★ An affine function to , i.e. a function of the form , is simultaneously convex and concave.
★ All norms are convex by the triangle inequality.
★ If is convex, the ''perspective function'' is convex for
★ Examples of functions which are monotonically increasing but not convex include and
★ Examples of functions which are convex but not monotonically increasing include ''x''2 and -''x''.
★ The function ''f''(''x'') = 1/''x'' is convex on the interval (0,+∞), but not on the interval (-∞,+∞), because of the singularity at ''x'' = 0.
★ A differentiable function defined on an interval is convex ''if and only if'' its derivative ''f'(''x'') is monotone nondecreasing, i.e. whenever
★ If the function ''f''(''x'') is convex, ''f''(''x'') differentiable at point ''c'', and ''f'' '(''c'') = ''0'', then ''c'' is a global minimum of ''f''(''x''). Note that this theorem does not follow from the previous one because it does not require the existence of ''f'' '(''x'') except at the point ''c''.
★ Convex optimization
★ Geodesic convexity
★ Logarithmically convex function
★ Quasiconvex function
★ Subderivative of a convex function
★ Convex analysis, , R. T., Rockafellar, Princeton University Press, ,
★ Linear and Nonlinear Programming, , David, Luenberger, Addison-Wesley, ,
★ Optimization by Vector Space Methods, , David, Luenberger, Wiley & Sons, ,
★ Convex Analysis and Optimization, , Dimitri, Bertsekas, Athena Scientific, ,
★ Hiriart-Urruty, Jean-Baptiste, and Lemaréchal, Claude. (2004). Fundamentals of Convex analysis. Berlin: Springer.
★ Borwein, Jonathan, and Lewis, Adrian. (2000). Convex Analysis and Nonlinear Optimization. Springer.
★ Stephen Boyd and Lieven Vandenberghe, Convex Optimization (book in pdf)
★ Jon Dattorro, Convex Optimization & Euclidean Distance Geometry
:
In other words, a function is convex if and only if its epigraph (the set of points lying on or above the graph) is a convex set.
A function is called 'strictly convex' if
:
for any ''t'' in (0,1) and
A function is said to be concave if is convex.
| Contents |
| Properties |
| Convex function calculus |
| Examples |
| Useful theorems |
| See also |
| References |
| External links |
Properties
A function (in blue) is convex if and only if the region above its graph (in green) is a convex set.
A convex function ''f'' defined on some open interval ''C'' is continuous on ''C'' and differentiable at all but at most countably many points. If ''C'' is closed, then ''f'' may fail to be continuous at the endpoints of ''C''.
A continuous function on an interval ''C'' is convex if and only if
:
for all ''x'' and ''y'' in ''C''.
A differentiable function of one variable is convex on an interval if and only if its derivative is monotonically non-decreasing on that interval.
A continuously differentiable function of one variable is convex on an interval if and only if the function lies above all of its tangents: ''f''(''y'') ≥ ''f''(''x'') + ''f'(''x'') (''y'' − ''x'') for all ''x'' and ''y'' in the interval.
A twice differentiable function of one variable is convex on an interval if and only if its second derivative is non-negative there; this gives a practical test for convexity.
If its second derivative is positive then it is strictly convex, but the converse does not hold, as shown by ''f''(''x'') = ''x''4.
More generally, a continuous, twice differentiable function of several variables is convex on a convex set if and only if its Hessian matrix is positive semidefinite on the interior of the convex set.
Any local minimum of a convex function is also a global minimum. A ''strictly'' convex function will have at most one global minimum.
For a convex function ''f'', the sublevel sets {''x'' | ''f''(''x'') < ''a''} and {''x'' | ''f''(''x'') ≤ ''a''} with ''a'' ∈ 'R' are convex sets. However, a function whose sublevel sets are convex sets may fail to be a convex function; such a function is called a ''quasiconvex function''.
Jensen's inequality applies to all convex functions. If is random, taking values in some domain , then
Convex function calculus
★ If and are convex functions, then so are and
★ Convexity is invariant under affine maps: that is, if is convex with , then so is , where
★ If is convex in and is a convex nonempty set, then is convex in provided for some
Examples
★ The second derivative of ''x''2 is 2; it follows that ''x''2 is a convex function of ''x''.
★ The absolute value function |''x''| is convex, even though it does not have a derivative at ''x'' = 0.
★ The function ''f'' with domain [0,1] defined by ''f''(0)=''f''(1)=1, ''f''(''x'')=0 for 0<''x''<1 is convex; it is continuous on the open interval (0,1), but not continuous at 0 and 1.
★ The function ''x''3 has second derivative 6''x''; thus it is convex for ''x'' ≥ 0 and concave for ''x'' ≤ 0.
★ Every linear transformation to is convex but not strictly convex, since if ''f'' is linear, then This statement still holds if we replace "convex" by "concave".
★ An affine function to , i.e. a function of the form , is simultaneously convex and concave.
★ All norms are convex by the triangle inequality.
★ If is convex, the ''perspective function'' is convex for
★ Examples of functions which are monotonically increasing but not convex include and
★ Examples of functions which are convex but not monotonically increasing include ''x''2 and -''x''.
★ The function ''f''(''x'') = 1/''x'' is convex on the interval (0,+∞), but not on the interval (-∞,+∞), because of the singularity at ''x'' = 0.
Useful theorems
★ A differentiable function defined on an interval is convex ''if and only if'' its derivative ''f'(''x'') is monotone nondecreasing, i.e. whenever
★ If the function ''f''(''x'') is convex, ''f''(''x'') differentiable at point ''c'', and ''f'' '(''c'') = ''0'', then ''c'' is a global minimum of ''f''(''x''). Note that this theorem does not follow from the previous one because it does not require the existence of ''f'' '(''x'') except at the point ''c''.
See also
★ Convex optimization
★ Geodesic convexity
★ Logarithmically convex function
★ Quasiconvex function
★ Subderivative of a convex function
References
★ Convex analysis, , R. T., Rockafellar, Princeton University Press, ,
★ Linear and Nonlinear Programming, , David, Luenberger, Addison-Wesley, ,
★ Optimization by Vector Space Methods, , David, Luenberger, Wiley & Sons, ,
★ Convex Analysis and Optimization, , Dimitri, Bertsekas, Athena Scientific, ,
★ Hiriart-Urruty, Jean-Baptiste, and Lemaréchal, Claude. (2004). Fundamentals of Convex analysis. Berlin: Springer.
★ Borwein, Jonathan, and Lewis, Adrian. (2000). Convex Analysis and Nonlinear Optimization. Springer.
External links
★ Stephen Boyd and Lieven Vandenberghe, Convex Optimization (book in pdf)
★ Jon Dattorro, Convex Optimization & Euclidean Distance Geometry
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
Español