convex function
71Konvexe und konkave Funktionen — Konvexe Funktion In der Analysis heißt eine Funktion f von einem Intervall I (oder allgemeiner einer konvexen Teilmenge C eines reellen Vektorraums) nach …
72Young's inequality — In mathematics, the standard form of Young s inequality states that if a and b are nonnegative real numbers and p and q are positive real numbers such that 1/ p + 1/ q = 1 then we have:ab le frac{a^p}{p} + frac{b^q}{q}.Equality holds if and only… …
73Ellipsoid method — The ellipsoid method is an algorithm for solving convex optimization problems. It was introduced by Naum Z. Shor, Arkady Nemirovsky, and David B. Yudin in 1972, and used by Leonid Khachiyan to prove the polynomial time solvability of linear… …
74Stress majorization — is an optimization strategy used in multidimensional scaling (MDS) where, for a set of n , m dimensional data items, a configuration X of n points in r( …
75Cartan–Hadamard theorem — The Cartan–Hadamard theorem is a statement in Riemannian geometry concerning the structure of complete Riemannian manifolds of non positive sectional curvature. The theorem states that the universal cover of such a manifold is diffeomorphic to a… …
76Hadamard three-circle theorem — In complex analysis, a branch of mathematics, the Hadamard three circle theorem is a result about the behavior of holomorphic functions.Let f(z) be a holomorphic function on the annulus :r 1leqleft| z ight| leq r 3. Let M(r) be the maximum of… …
77List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …
78Subgradient method — Subgradient methods are algorithms for solving convex optimization problems. Originally developed by Naum Z. Shor and others in the 1960s and 1970s, subgradient methods can be used with a non differentiable objective function. When the objective… …
79Convexidad logarítmica — Esta página o sección está siendo traducida del idioma inglés a partir del artículo Logarithmically convex function, razón por la cual puede haber lagunas de contenidos, errores sintácticos o escritos sin traducir. Puedes colaborar con… …
80Majorization — This article is about a partial ordering of vectors on Rd. For functions, see Lorenz ordering. In mathematics, majorization is a partial order on vectors of real numbers. For a vector , we denote by the vector with the same components, but sorted …
