convex function
61Differential geometry of surfaces — Carl Friedrich Gauss in 1828 In mathematics, the differential geometry of surfaces deals with smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives:… …
62Transportation theory — In mathematics and economics, transportation theory is a name given to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781.[1] In the 1920s A.N. Tolstoi was …
63Maximum principle — This article describes the maximum principle in the theory of partial differential equations. For the maximum principle in optimal control theory, see Pontryagin s minimum principle. In mathematics, the maximum principle is a property of… …
64Conic optimization — is a subfield of convex optimization that studies a class of structured convex optimization problems called conic optimization problems. A conic optimization problem consists of minimizing a convex function over the intersection of an affine… …
65Modulus and characteristic of convexity — In mathematics, the modulus and 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 …
66List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… …
67Derivative (generalizations) — Derivative is a fundamental construction of differential calculus and admits many possible generalizations within the fields of mathematical analysis, combinatorics, algebra, and geometry. Derivatives in analysis In real, complex, and functional… …
68Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… …
69Konkave Funktion — Konvexe Funktion In der Analysis heißt eine Funktion f von einem Intervall I (oder allgemeiner einer konvexen Teilmenge C eines reellen Vektorraums) nach …
70Konvexe Funktion — In der Analysis heißt eine Funktion f von einem Intervall I (oder allgemeiner einer konvexen Teilmenge C eines reellen Vektorraums) nach …
