pseudo-convex
Смотреть что такое "pseudo-convex" в других словарях:
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
Locally convex topological vector space — In functional analysis and related areas of mathematics, locally convex topological vector spaces or locally convex spaces are examples of topological vector spaces (TVS) which generalize normed spaces. They can be defined as topological vector… … Wikipedia
Vagif Guliyev — Infobox Person image size = 150px name = Vagif Guliyev Vaqif Sabir oğlu Quliyev nationality = flagicon|Azerbaijan Azerbaijani caption = birth date = 1957 birth place = Salyan, Azerbaijan SSR USSR death date = death place = education = occupation … Wikipedia
Masatake Kuranishi — (jap. 倉西 正武, Kuranishi Masatake; * 19. Juli 1924 in Tokio, Präfektur Tokio) ist ein japanischer Mathematiker, der sich mit komplexer Analysis, partiellen Differentialgleichungen und Differentialgeometrie beschäftigt. Inhaltsverzeichnis 1 Leben 2… … Deutsch Wikipedia
Pseudotriangle — In Euclidean plane geometry, a pseudotriangle is the simply connected subset of the plane that lies between any three mutually tangent convex sets. A pseudotriangulation is a partition of a region of the plane into pseudotriangles, and a pointed… … 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
Mathematical economics — Economics … Wikipedia
Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Maxillary central incisor — Maxillary central incisors of permanent and primary teeth marked in red. The maxillary central incisor is a human tooth in the front upper jaw, or maxilla, and is usually the most visible of all teeth in the mouth. It is located mesial (closer to … Wikipedia
