When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Derivative test - Wikipedia

    en.wikipedia.org/wiki/Derivative_test

    Specifically, a twice-differentiable function f is concave up if ″ > and concave down if ″ <. Note that if f ( x ) = x 4 {\displaystyle f(x)=x^{4}} , then x = 0 {\displaystyle x=0} has zero second derivative, yet is not an inflection point, so the second derivative alone does not give enough information to determine whether a given point is ...

  3. Concave function - Wikipedia

    en.wikipedia.org/wiki/Concave_function

    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. Near a strict local maximum in the interior of the domain of a function, the function must be concave; as a partial converse, if the derivative of a strictly concave ...

  4. Second derivative - Wikipedia

    en.wikipedia.org/wiki/Second_derivative

    If the second derivative of a function changes sign, the graph of the function will switch from concave down to concave up, or vice versa. A point where this occurs is called an inflection point. Assuming the second derivative is continuous, it must take a value of zero at any inflection point, although not every point where the second ...

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

  6. Obstacle problem - Wikipedia

    en.wikipedia.org/wiki/Obstacle_problem

    The obstacle problem is a classic motivating example in the mathematical study of variational inequalities and free boundary problems. The problem is to find the equilibrium position of an elastic membrane whose boundary is held fixed, and which is constrained to lie above a given obstacle.

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

  8. Inflection point - Wikipedia

    en.wikipedia.org/wiki/Inflection_point

    For the graph of a function f of differentiability class C 2 (its first derivative f', and its second derivative f'', exist and are continuous), the condition f'' = 0 can also be used to find an inflection point since a point of f'' = 0 must be passed to change f'' from a positive value (concave upward) to a negative value (concave downward) or ...

  9. Sigmoid function - Wikipedia

    en.wikipedia.org/wiki/Sigmoid_function

    A sigmoid function is convex for values less than a particular point, and it is concave for values greater than that point: in many of the examples here, that point is 0. Examples [ edit ]