Wikipedia Article of the Day
Randomly selected articles from my personal browsing history
In mathematics, a real-valued function is called convex if the line segment between any two distinct points on the graph of the function lies above the graph between the two points. Equivalently, a function is convex if its epigraph (the set of points on or above the graph of the function) is a convex set. In simple terms, a convex function graph is shaped like a cup ∪ {\displaystyle \cup } (or a straight line like a linear function), while a concave function's graph is shaped like a cap ∩ {\displaystyle \cap } . A twice-differentiable function of a single variable is convex if and only if its second derivative is nonnegative on its entire domain. Well-known examples of convex functions of a single variable include a linear function f ( x ) = c x {\displaystyle f(x)=cx} (where c {\displaystyle c} is a real number), a quadratic function c x 2 {\displaystyle cx^{2}} ( c {\displaystyle c} as a nonnegative real number) and an exponential function c e x {\displaystyle ce^{x}} ( c {\displaystyle c} as a nonnegative real number). Convex functions play an important role in many areas of mathematics. They are especially important in the study of optimization problems where they are distinguished by a number of convenient properties. For instance, a strictly convex function on an open set has no more than one minimum. Even in infinite-dimensional spaces, under suitable additional hypotheses, convex functions continue to satisfy such properties and as a result, they are the most well-understood functionals in the calculus of variations. In probability theory, a convex function applied to the expected value of a random variable is always bounded above by the expected value of the convex function of the random variable. This result, known as Jensen's inequality, can be used to deduce inequalities such as the arithmetic–geometric mean inequality and Hölder's inequality.
History
Dec 26
Undertow (water waves)
Dec 25
F-distribution
Dec 24
Cumulative distribution function
Dec 23
Probability mass function
Dec 22
Book cipher
Dec 21
Poisson point process
Dec 20
Generic top-level domain
Dec 19
Beale ciphers
Dec 18
Heavyweight (podcast)
Dec 17
MurmurHash
Dec 16
Attempted assassination of Ronald Reagan
Dec 15
Mnemonic major system
Dec 14
Peter M. Lenkov
Dec 13
Lagrange polynomial
Dec 12
Polynomial interpolation
Dec 11
Newton polynomial
Dec 10
Quantile function
Dec 9
Static site generator
Dec 8
Flag Day (United States)
Dec 7
Seven-segment display character representations
Dec 6
Tori Kelly
Dec 5
Lynn Conway
Dec 4
G7
Dec 3
Nostr
Dec 2
Negative binomial distribution
Dec 1
Toledo War
Nov 30
Laurent series
Nov 29
Interface control document
Nov 28
ANT (network)
Nov 27
Functional analysis