When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Convex function - Wikipedia

    en.wikipedia.org/wiki/Convex_function

    A graph of the bivariate convex function x 2 + xy + y 2. Convex vs. Not convex. 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 or on the graph between the two points. Equivalently, a function is convex if its epigraph (the set of points on or ...

  3. Concave function - Wikipedia

    en.wikipedia.org/wiki/Concave_function

    A function f is concave over a convex set if and only if the function −f is a convex function over the set. The sum of two concave functions is itself concave and so is the pointwise minimum of two concave functions, i.e. the set of concave functions on a given domain form a semifield.

  4. Convex set - Wikipedia

    en.wikipedia.org/wiki/Convex_set

    A function is convex if and only if its epigraph, the region (in green) above its graph (in blue), is a convex set.. Let S be a vector space or an affine space over the real numbers, or, more generally, over some ordered field (this includes Euclidean spaces, which are affine spaces).

  5. List of convexity topics - Wikipedia

    en.wikipedia.org/wiki/List_of_convexity_topics

    Convex function - a function in which the line segment between any two points on the graph of the function lies above the graph. Closed convex function - a convex function all of whose sublevel sets are closed sets. Proper convex function - a convex function whose effective domain is nonempty and it never attains minus infinity. Concave ...

  6. Convex analysis - Wikipedia

    en.wikipedia.org/wiki/Convex_analysis

    Convex analysis includes not only the study of convex subsets of Euclidean spaces but also the study of convex functions on abstract spaces. Convex analysis is the branch of mathematics devoted to the study of properties of convex functions and convex sets, often with applications in convex minimization, a subdomain of optimization theory.

  7. Convex hull - Wikipedia

    en.wikipedia.org/wiki/Convex_hull

    In geometry, the convex hull, convex envelope or convex closure [1] of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space , or equivalently as the set of all convex combinations of points in the subset.

  8. Second derivative - Wikipedia

    en.wikipedia.org/wiki/Second_derivative

    The second derivative of a function f can be used to determine the concavity of the graph of f. [2] A function whose second derivative is positive is said to be concave up (also referred to as convex), meaning that the tangent line near the point where it touches the function will lie below the graph of the function.

  9. Logarithmically concave function - Wikipedia

    en.wikipedia.org/wiki/Logarithmically_concave...

    This follows from the fact that the convolution of two log-concave functions is log-concave. The product of two log-concave functions is log-concave. This means that joint densities formed by multiplying two probability densities (e.g. the normal-gamma distribution, which always has a shape parameter ≥ 1) will be log-concave.