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 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 .

  5. 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.

  6. Convex subgraph - Wikipedia

    en.wikipedia.org/wiki/Convex_subgraph

    In this graph, triangle 1-2-5 is convex, but path 2-3-4 is not, because it does not include one of the two shortest paths from 2 to 4. In metric graph theory, a convex subgraph of an undirected graph G is a subgraph that includes every shortest path in G between two of its vertices.

  7. Concavification - Wikipedia

    en.wikipedia.org/wiki/Concavification

    In mathematics, concavification is the process of converting a non-concave function to a concave function. A related concept is convexification – converting a non-convex function to a convex function. It is especially important in economics and mathematical optimization. [1]

  8. Convex curve - Wikipedia

    en.wikipedia.org/wiki/Convex_curve

    A convex curve (black) forms a connected subset of the boundary of a convex set (blue), and has a supporting line (red) through each of its points. A parabola, a convex curve that is the graph of the convex function () = In geometry, a convex curve is a plane curve that has a supporting line through each of its points.

  9. Epigraph (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Epigraph_(mathematics)

    Epigraph of a function A function (in black) is convex if and only if the region above its graph (in green) is a convex set.This region is the function's epigraph. In mathematics, the epigraph or supergraph [1] of a function: [,] valued in the extended real numbers [,] = {} is the set ⁡ = {(,) : ()} consisting of all points in the Cartesian product lying on or above the function's graph. [2]