enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Convex_function

    An example of a function which is convex but not strictly convex is (,) = +. This function is not strictly convex because any two points sharing an x coordinate will have a straight line between them, while any two points NOT sharing an x coordinate will have a greater value of the function than the points between them.

  3. Modulus and characteristic of convexity - Wikipedia

    en.wikipedia.org/wiki/Modulus_and_characteristic...

    In mathematics, the modulus of convexity and the characteristic of convexity are measures of "how convex" the unit ball in a Banach space is. In some sense, the modulus of convexity has the same relationship to the ε-δ definition of uniform convexity as the modulus of continuity does to the ε-δ definition of continuity.

  4. Convolution - Wikipedia

    en.wikipedia.org/wiki/Convolution

    It can be shown that the infimal convolution of convex functions is convex. Furthermore, it satisfies an identity analogous to that of the Fourier transform of a traditional convolution, with the role of the Fourier transform is played instead by the Legendre transform : φ ∗ ( x ) = sup y ( x ⋅ y − φ ( y ) ) . {\displaystyle \varphi ...

  5. Convex graph - Wikipedia

    en.wikipedia.org/wiki/Convex_graph

    Download as PDF; Printable version; ... In mathematics, a convex graph may be a convex bipartite graph; a convex ... the graph of a convex function

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

  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. Logarithmically concave function - Wikipedia

    en.wikipedia.org/wiki/Logarithmically_concave...

    This follows from the fact that the logarithm is monotone implying that the superlevel sets of this function are convex. [1] Every concave function that is nonnegative on its domain is log-concave. However, the reverse does not necessarily hold. An example is the Gaussian function f(x) = exp(−x 2 /2) which is log-concave since log f(x) = −x ...

  9. Proper convex function - Wikipedia

    en.wikipedia.org/wiki/Proper_convex_function

    For every proper convex function : [,], there exist some and such that ()for every .. The sum of two proper convex functions is convex, but not necessarily proper. [4] For instance if the sets and are non-empty convex sets in the vector space, then the characteristic functions and are proper convex functions, but if = then + is identically equal to +.