- semidefinite function
- мат. полуопределенная функция
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… … Wikipedia
Positive semidefinite — In mathematics, positive semidefinite may refer to: * positive semidefinite matrix * positive semidefinite function ee also* semidefinite bilinear form … Wikipedia
Convex function — on an interval. A function (in black) is convex if and only i … Wikipedia
Lyapunov function — In mathematics, Lyapunov functions are functions which can be used to prove the stability of a certain fixed point in a dynamical system or autonomous differential equation. Named after the Russian mathematician Aleksandr Mikhailovich Lyapunov,… … Wikipedia
Plurisubharmonic function — In mathematics, plurisubharmonic functions form an important class of functions used in complex analysis. On a Kahler manifold,plurisubharmonic functions form a subset of the subharmonic functions. However, unlikesubharmonic functions (which are… … Wikipedia
Positive-definite function — In mathematics, the term positive definite function may refer to a couple of different concepts. Contents 1 In dynamical systems 2 In analysis 2.1 Bochner s theorem 2.1.1 Applications … Wikipedia
Positive-definite matrix — In linear algebra, a positive definite matrix is a matrix that in many ways is analogous to a positive real number. The notion is closely related to a positive definite symmetric bilinear form (or a sesquilinear form in the complex case). The… … Wikipedia
Matrix (mathematics) — Specific elements of a matrix are often denoted by a variable with two subscripts. For instance, a2,1 represents the element at the second row and first column of a matrix A. In mathematics, a matrix (plural matrices, or less commonly matrixes)… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … 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
Conic 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… … Wikipedia