Jump to content

Proper convex function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Mgkrupa (talk | contribs) at 23:24, 5 February 2021 (Reworded). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematical analysis, in particular the subfields of convex analysis and optimization, a proper convex function is an extended real-valued convex function with a non-empty domain, that never takes on the value and also is not identically equal to

In convex analysis and variational analysis, a point at which some given function valued in the extended real number line is minimized is typically sought,[1] where such a point (if it exists) is called a global minimum point. If the function takes as a value then it is necessarily a global minimum value and the minimization problem can be answered; this is why the definition of "proper" requires that the function never take as a value. Assuming this, if the function's domain is empty or if the function is identically equal to then the minimization problem once again has an immediate answer. Extended real-valued function for which the minimization problem is not solved by any one of these three trivial cases are exactly those that are called proper.

If the problem is instead a maximization problem (which would be clearly indicated, such as by the function being concave rather than convex) then the definition of "proper" is defined in an analogous, but different, manner but with the same goal: to exclude cases where the maximization problem can be answered immediately. Specifically, a concave function is called proper if its negation which is a convex function, is proper in the sense defined above.

Definitions

Suppose that is a function taking values in the extended real number line If is a convex function or if the minimum of is being sought, then is called proper if there exists some point in its domain such that

and also

for every That is, a function is proper if its effective domain is nonempty and it never attains .[2] This means that there exists some at which and is also never equal to Convex functions that are not proper are called improper convex functions.[3]

A proper concave function is by definition, any function such that is a proper convex function.

Properties

For every proper convex function there exist some and such that

for every

The sum of two proper convex functions is convex, but not necessarily proper.[4] For instance if the sets and are non-empty convex sets in the vector space then the characteristic functions and are proper convex functions, but if then is identically equal to

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

See also

Citations

  1. ^ Rockafellar & Wets 2009, pp. 1–28.
  2. ^ Aliprantis, C.D.; Border, K.C. (2007). Infinite Dimensional Analysis: A Hitchhiker's Guide (3 ed.). Springer. p. 254. doi:10.1007/3-540-29587-9. ISBN 978-3-540-32696-0.
  3. ^ Rockafellar, R. Tyrrell (1997) [1970]. Convex Analysis. Princeton, NJ: Princeton University Press. p. 24. ISBN 978-0-691-01586-6.
  4. ^ Boyd, Stephen (2004). Convex Optimization. Cambridge, UK: Cambridge University Press. p. 79. ISBN 978-0-521-83378-3.
  5. ^ Ioffe, Aleksandr Davidovich; Tikhomirov, Vladimir Mikhaĭlovich (2009), Theory of extremal problems, Studies in Mathematics and its Applications, vol. 6, North-Holland, p. 168, ISBN 9780080875279.

References