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

  4. Convex analysis - Wikipedia

    en.wikipedia.org/wiki/Convex_analysis

    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. A graph of the bivariate convex function + +.

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

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

  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. Linear programming - Wikipedia

    en.wikipedia.org/wiki/Linear_programming

    Otherwise, if a feasible solution exists and if the constraint set is bounded, then the optimum value is always attained on the boundary of the constraint set, by the maximum principle for convex functions (alternatively, by the minimum principle for concave functions) since linear functions are both convex and concave. However, some problems ...