When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

  3. Convex set - Wikipedia

    en.wikipedia.org/wiki/Convex_set

    A set that is not convex is called a non-convex set. A polygon that is not a convex polygon is sometimes called a concave polygon, [4] and some sources more generally use the term concave set to mean a non-convex set, [5] but most authorities prohibit this usage. [6] [7]

  4. Convex function - Wikipedia

    en.wikipedia.org/wiki/Convex_function

    The term convex is often referred to as convex down or concave upward, and the term concave is often referred as concave down or convex upward. [ 3 ] [ 4 ] [ 5 ] If the term "convex" is used without an "up" or "down" keyword, then it refers strictly to a cup shaped graph ∪ {\displaystyle \cup } .

  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 geometry - Wikipedia

    en.wikipedia.org/wiki/Convex_geometry

    Convex geometry is a relatively young mathematical discipline. Although the first known contributions to convex geometry date back to antiquity and can be traced in the works of Euclid and Archimedes, it became an independent branch of mathematics at the turn of the 20th century, mainly due to the works of Hermann Brunn and Hermann Minkowski in dimensions two and three.

  7. Convex optimization - Wikipedia

    en.wikipedia.org/wiki/Convex_optimization

    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. [8]

  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. Convex combination - Wikipedia

    en.wikipedia.org/wiki/Convex_combination

    A conical combination is a linear combination with nonnegative coefficients. When a point is to be used as the reference origin for defining displacement vectors, then is a convex combination of points ,, …, if and only if the zero displacement is a non-trivial conical combination of their respective displacement vectors relative to .