Quasiconvex function: Difference between revisions
added an operation not preserving quasiconvexity |
No edit summary |
||
Line 3: | Line 3: | ||
In [[mathematics]], a '''quasiconvex function''' is a [[real number|real]]-valued [[function (mathematics)|function]] defined on an [[interval (mathematics)|interval]] or on a [[convex set|convex subset]] of a real [[vector space]] such that the [[inverse image]] of any set of the form <math>(-\infty,a)</math> is a [[convex set]]. |
In [[mathematics]], a '''quasiconvex function''' is a [[real number|real]]-valued [[function (mathematics)|function]] defined on an [[interval (mathematics)|interval]] or on a [[convex set|convex subset]] of a real [[vector space]] such that the [[inverse image]] of any set of the form <math>(-\infty,a)</math> is a [[convex set]]. |
||
⚫ | |||
==Definition and properties== |
|||
⚫ | |||
: <math>f(\lambda x + (1 - \lambda)y)\leq\max\big(f(x),f(y)\big).</math> |
: <math>f(\lambda x + (1 - \lambda)y)\leq\max\big(f(x),f(y)\big).</math> |
Revision as of 14:02, 26 May 2010
In mathematics, a quasiconvex function is a real-valued function defined on an interval or on a convex subset of a real vector space such that the inverse image of any set of the form is a convex set.
A function defined on a convex subset S of a real vector space is quasiconvex if whenever and then
If instead
for any and , then is strictly quasiconvex.
A quasiconcave function is a function whose negative is quasiconvex, and a strictly quasiconcave function is a function whose negative is strictly quasiconvex. Equivalently a function is quasiconcave if
and strictly quasiconcave if
A (strictly) quasiconvex function has (strictly) convex lower contour sets, while a (strictly) quasiconcave function has (strictly) convex upper contour sets.
A function that is both quasiconvex and quasiconcave is quasilinear.
Optimization methods that work for quasiconvex functions come under the heading of quasiconvex programming. This comes under the broad heading of mathematical programming and generalizes both linear programming and convex programming.
There are also minimax theorems on quasiconvex functions, such as Sion's minimax theorem, which is a far-reaching generalization of the result of von Neumann and Oskar Morgenstern.
In economics quasiconcave utility functions are desirable as they imply a strictly convex set of preferences.
Operations preserving quasiconvexity
- non-negative weighted maximum of quasiconvex functions (i.e. with non-negative)
- composition with a non-decreasing function (i.e. quasiconvex, non-decreasing, then is quasiconvex)
- minimization (i.e. quasiconvex, convex set, then is quasiconvex)
Operations not preserving quasiconvexity
- sum of quasiconvex functions defined on the same domain (i.e. if are quasiconvex, could be not quasiconvex)
- sum of quasiconvex functions defined on different domains (i.e. if are quasiconvex, could be not quasiconvex)
Examples
- Every convex function is quasiconvex.
- Any monotonic function is both quasiconvex and quasiconcave. More generally, a function which decreases up to a point and increases from that point on is quasiconvex.
- The floor function is an example of a quasiconvex function that is neither convex nor continuous.
See also
References
- Avriel, M., Diewert, W.E., Schaible, S. and Zang, I., Generalized Concavity, Plenum Press, 1988.
External links
- SION, M., "On general minimax theorems", Pacific J. Math. 8 (1958), 171-176.
- Mathematical programming glossary
- Concave and Quasi-Concave Functions - by Charles Wilson, NYU Department of Economics
- Quasiconcave - From Econterms, for About.com
- Quasiconcavity and quasiconvexity - by Martin J. Osborne, University of Toronto Department of Economics
- Anatomy of Cobb-Douglas Type Utility Functions in 3D - several examples of quasiconcave utility functions