Neha Patil (Editor)

Proper convex function

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematical analysis (in particular convex analysis) and optimization, a proper convex function is a convex function f taking values in the extended real number line such that

f ( x ) < +

for at least one x and

f ( x ) >

for every x. That is, a convex function is proper if its effective domain is nonempty and it never attains . Convex functions that are not proper are called improper convex functions.

A proper concave function is any function g such that f = g is a proper convex function.

Properties

For every proper convex function f on Rn there exist some b in Rn and β in R such that

f ( x ) x b β

for every x.

The sum of two proper convex functions is not necessarily proper or convex. For instance if the sets A X and B X are non-empty convex sets in the vector space X, then the indicator functions I A and I B are proper convex functions, but if A B = then I A + I B is identically equal to + .

The infimal convolution of two proper convex functions is convex but not necessarily proper convex.

References

Proper convex function Wikipedia