- polynomial convexity
- мат. полиномиальная выпуклость
Большой англо-русский и русско-английский словарь. 2001.
polynomial convexity
Смотреть что такое "polynomial convexity" в других словарях:
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Fixed income attribution — refers to the process of measuring returns generated by various sources of risk in a fixed income portfolio, particularly when multiple sources of return are active at the same time. For example, the risks affecting the return of a bond portfolio … Wikipedia
Fixed-income attribution — refers to the process of measuring returns generated by various sources of risk in a fixed income portfolio, particularly when multiple sources of return are active at the same time. For example, the risks affecting the return of a bond portfolio … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Hardy space — In complex analysis, the Hardy spaces (or Hardy classes) Hp are certain spaces of holomorphic functions on the unit disk or upper half plane. They were introduced by Frigyes Riesz (Riesz 1923), who named them after G. H. Hardy, because of the… … Wikipedia
Czesław Olech — Born May 22, 1931 (1931 05 22) (age 80) Pińczów, Poland Nationality Polish … Wikipedia
Optimal design — This article is about the topic in the design of experiments. For the topic in optimal control theory, see shape optimization. Gustav Elfving developed the optimal design of experiments, and so minimized surveyors need for theodolite measurements … Wikipedia
List 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… … Wikipedia
Orders of approximation — In science, engineering, and other quantitative disciplines, orders of approximation refer to formal or informal terms for how precise an approximation is, and to indicate progressively more refined approximations: in increasing order of… … Wikipedia
