enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Convex function - Wikipedia

    en.wikipedia.org/wiki/Convex_function

    In simple terms, a convex function graph is shaped like a cup (or a straight line like a linear function), while a concave function's graph is shaped like a cap . A twice- differentiable function of a single variable is convex if and only if its second derivative is nonnegative on its entire domain . [ 1 ]

  3. Convex optimization - Wikipedia

    en.wikipedia.org/wiki/Convex_optimization

    Many optimization problems can be equivalently formulated in this standard form. For example, the problem of maximizing a concave function can be re-formulated equivalently as the problem of minimizing the convex function . The problem of maximizing a concave function over a convex set is commonly called a convex optimization problem.

  4. Convex analysis - Wikipedia

    en.wikipedia.org/wiki/Convex_analysis

    then is called strictly convex. [1]Convex functions are related to convex sets. Specifically, the function is convex if and only if its epigraph. A function (in black) is convex if and only if its epigraph, which is the region above its graph (in green), is a convex set.

  5. Convex curve - Wikipedia

    en.wikipedia.org/wiki/Convex_curve

    A plane curve is the image of any continuous function from an interval to the Euclidean plane.Intuitively, it is a set of points that could be traced out by a moving point. More specifically, smooth curves generally at least require that the function from the interval to the plane be continuously differentiable, and in some contexts are defined to require higher derivative

  6. Jensen's inequality - Wikipedia

    en.wikipedia.org/wiki/Jensen's_inequality

    Jensen's inequality generalizes the statement that a secant line of a convex function lies above its graph. Visualizing convexity and Jensen's inequality. In mathematics, Jensen's inequality, named after the Danish mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function.

  7. Convexity (algebraic geometry) - Wikipedia

    en.wikipedia.org/wiki/Convexity_(algebraic_geometry)

    In algebraic geometry, convexity is a restrictive technical condition for algebraic varieties originally introduced to analyze Kontsevich moduli spaces ¯, (,) in quantum cohomology. [ 1 ] : §1 [ 2 ] [ 3 ] These moduli spaces are smooth orbifolds whenever the target space is convex.

  8. Concave function - Wikipedia

    en.wikipedia.org/wiki/Concave_function

    A differentiable function f is (strictly) concave on an interval if and only if its derivative function f ′ is (strictly) monotonically decreasing on that interval, that is, a concave function has a non-increasing (decreasing) slope.

  9. List of convexity topics - Wikipedia

    en.wikipedia.org/wiki/List_of_convexity_topics

    The convexity property can make optimization in some sense "easier" than the general case - for example, any local minimum must be a global minimum. Convex polygon - a 2-dimensional polygon whose interior is a convex set in the Euclidean plane. Convex polytope - an n-dimensional polytope which is also a convex set in the Euclidean n-dimensional ...