|
Spectrahedron
In convex geometry, a spectrahedron is a shape that can be represented as a linear matrix inequality. Alternatively, the set of positive semidefinite matrices forms a convex cone in , and a spectrahedron is a shape that can be formed by intersecting this cone with an affine subspace. Spectrahedra are the feasible regions of semidefinite programs. The images of spectrahedra under linear or affine transformations are called ''projected spectrahedra'' or ''spectrahedral shadows''. Every spectrahedral shadow is a convex set that is also semialgebraic, but the converse (conjectured to be true until 2017) is false. An example of a spectrahedron is the spectraplex, defined as : \mathrm_n = \, where \mathbf^n_+ is the set of positive semidefinite matrices and \operatorname(X) is the trace of the matrix X. The spectraplex is a compact set, and can be thought of as the "semidefinite" analog of the simplex. See also * N-ellipse In geometry, the -ellipse is a generalization ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplex
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, * a 0-dimensional simplex is a point, * a 1-dimensional simplex is a line segment, * a 2-dimensional simplex is a triangle, * a 3-dimensional simplex is a tetrahedron, and * a 4-dimensional simplex is a 5-cell. Specifically, a -simplex is a -dimensional polytope that is the convex hull of its vertices. More formally, suppose the points u_0, \dots, u_k are affinely independent, which means that the vectors u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points C = \left\. A regular simplex is a simplex that is also a regular polytope. A regular -simplex may be constructed from a regular -simplex by connecting a new vertex to all original vertices by the common ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Matrix Inequality
In convex optimization, a linear matrix inequality (LMI) is an expression of the form : \operatorname(y):=A_0+y_1A_1+y_2A_2+\cdots+y_m A_m\succeq 0\, where * y= _i\,,~i\!=\!1,\dots, m/math> is a real vector, * A_0, A_1, A_2,\dots,A_m are n\times n symmetric matrices \mathbb^n, * B\succeq0 is a generalized inequality meaning B is a positive semidefinite matrix belonging to the positive semidefinite cone \mathbb_+ in the subspace of symmetric matrices \mathbb{S}. This linear matrix inequality specifies a convex constraint on y. Applications There are efficient numerical methods to determine whether an LMI is feasible (''e.g.'', whether there exists a vector ''y'' such that LMI(''y'') ≥ 0), or to solve a convex optimization problem with LMI constraints. Many optimization problems in control theory, system identification and signal processing can be formulated using LMIs. Also LMIs find application in Polynomial Sum-Of-Squares. The prototypical primal and dual sem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
N-ellipse
In geometry, the -ellipse is a generalization of the ellipse allowing more than two foci. -ellipses go by numerous other names, including multifocal ellipse, polyellipse, egglipse, -ellipse, and Tschirnhaus'sche Eikurve (after Ehrenfried Walther von Tschirnhaus). They were first investigated by James Clerk Maxwell in 1846. Given focal points in a plane, an -ellipse is the locus of points of the plane whose sum of distances to the foci is a constant . In formulas, this is the set : \left\. The 1-ellipse is the circle, and the 2-ellipse is the classic ellipse. Both are algebraic curves of degree 2. For any number of foci, the -ellipse is a closed, convex curve. The curve is smooth unless it goes through a focus. The ''n''-ellipse is in general a subset of the points satisfying a particular algebraic equation. If ''n'' is odd, the algebraic degree of the curve is 2^n, while if ''n'' is even the degree is 2^n - \binom.J. Nie, P.A. Parrilo, B. Sturmfels:J. Nie, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
S Asdf Rot
S, or s, is the nineteenth letter of the Latin alphabet, used in the English alphabet, the alphabets of other western European languages and other latin alphabets worldwide. Its name in English is ''ess'' (pronounced ), plural ''esses''. History Northwest Semitic šîn represented a voiceless postalveolar fricative (as in 'ip'). It originated most likely as a pictogram of a tooth () and represented the phoneme via the acrophonic principle. Ancient Greek did not have a "sh" phoneme, so the derived Greek letter Sigma () came to represent the voiceless alveolar sibilant . While the letter shape Σ continues Phoenician ''šîn'', its name ''sigma'' is taken from the letter ''Samekh'', while the shape and position of ''samekh'' but name of ''šîn'' is continued in the '' xi''. Within Greek, the name of ''sigma'' was influenced by its association with the Greek word (earlier ), "to hiss". The original name of the letter "Sigma" may have been ''san'', but due to the earl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Geometry
In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas: computational geometry, convex analysis, discrete geometry, functional analysis, geometry of numbers, integral geometry, linear programming, probability theory, game theory, etc. Classification According to the Mathematics Subject Classification MSC2010, the mathematical discipline ''Convex and Discrete Geometry'' includes three major branches: * general convexity * polytopes and polyhedra * discrete geometry (though only portions of the latter two are included in convex geometry). General convexity is further subdivided as follows: *axiomatic and generalized convexity *convex sets without dimension restrictions *convex sets in topological vector spaces *convex sets in 2 dimensions (including convex curves) *convex sets in 3 dimensions (including convex surfaces) *convex sets in ''n'' dimensions (including convex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Positive Semidefinite Matrix
In mathematics, a symmetric matrix M with real entries is positive-definite if the real number \mathbf^\mathsf M \mathbf is positive for every nonzero real column vector \mathbf, where \mathbf^\mathsf is the row vector transpose of \mathbf. More generally, a Hermitian matrix (that is, a complex matrix equal to its conjugate transpose) is positive-definite if the real number \mathbf^* M \mathbf is positive for every nonzero complex column vector \mathbf, where \mathbf^* denotes the conjugate transpose of \mathbf. Positive semi-definite matrices are defined similarly, except that the scalars \mathbf^\mathsf M \mathbf and \mathbf^* M \mathbf are required to be positive ''or zero'' (that is, nonnegative). Negative-definite and negative semi-definite matrices are defined analogously. A matrix that is not positive semi-definite and not negative semi-definite is sometimes called ''indefinite''. Some authors use more general definitions of definiteness, permitting the matrices to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Cone
In linear algebra, a cone—sometimes called a linear cone to distinguish it from other sorts of cones—is a subset of a real vector space that is closed under positive scalar multiplication; that is, C is a cone if x\in C implies sx\in C for every . This is a broad generalization of the standard cone in Euclidean space. A convex cone is a cone that is also closed under addition, or, equivalently, a subset of a vector space that is closed under linear combinations with positive coefficients. It follows that convex cones are convex sets. The definition of a convex cone makes sense in a vector space over any ordered field, although the field of real numbers is used most often. Definition A subset C of a vector space is a cone if x\in C implies sx\in C for every s>0. Here s>0 refers to (strict) positivity in the scalar field. Competing definitions Some other authors require ,\infty)C\subset C or even 0\in C. Some require a cone to be convex and/or satisfy C\cap-C\subset\. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Affine Subspace
In mathematics, an affine space is a geometry, geometric structure (mathematics), structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance (mathematics), distance and measure of angles, keeping only the properties related to parallel (geometry), parallelism and ratio of lengths for parallel line segments. Affine space is the setting for affine geometry. As in Euclidean space, the fundamental objects in an affine space are called ''point (geometry), points'', which can be thought of as locations in the space without any size or shape: zero-dimensional. Through any pair of points an infinite straight line can be drawn, a one-dimensional set of points; through any three points that are not collinear, a two-dimensional plane (geometry), plane can be drawn; and, in general, through points in general position, a -dimensional flat (geometry), flat or affine subspace can be drawn. Affine space is charact ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Feasible Region
In mathematical optimization and computer science, a feasible region, feasible set, or solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints. This is the initial set of candidate solutions to the problem, before the set of candidates has been narrowed down. For example, consider the problem of minimizing the function x^2+y^4 with respect to the variables x and y, subject to 1 \le x \le 10 and 5 \le y \le 12. \, Here the feasible set is the set of pairs (''x'', ''y'') in which the value of ''x'' is at least 1 and at most 10 and the value of ''y'' is at least 5 and at most 12. The feasible set of the problem is separate from the objective function, which states the criterion to be optimized and which in the above example is x^2+y^4. In many problems, the feasible set reflects a constraint that one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semidefinite Programming
Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize) over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron. Semidefinite programming is a relatively new field of optimization which is of growing interest for several reasons. Many practical problems in operations research and combinatorial optimization can be modeled or approximated as semidefinite programming problems. In automatic control theory, SDPs are used in the context of linear matrix inequalities. SDPs are in fact a special case of cone programming and can be efficiently solved by interior point methods. All linear programs and (convex) quadratic programs can be expressed as SDPs, and via hierarchies of SDPs the solutions of polynomial optimization problems can be approximated. Semidefinite programming ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Affine Transformation
In Euclidean geometry, an affine transformation or affinity (from the Latin, '' affinis'', "connected with") is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles. More generally, an affine transformation is an automorphism of an affine space (Euclidean spaces are specific affine spaces), that is, a function which maps an affine space onto itself while preserving both the dimension of any affine subspaces (meaning that it sends points to points, lines to lines, planes to planes, and so on) and the ratios of the lengths of parallel line segments. Consequently, sets of parallel affine subspaces remain parallel after an affine transformation. An affine transformation does not necessarily preserve angles between lines or distances between points, though it does preserve ratios of distances between points lying on a straight line. If is the point set of an affine space, then every affine transformation on can ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Set
In geometry, a set of points is convex if it contains every line segment between two points in the set. For example, a solid cube (geometry), cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary (topology), boundary of a convex set in the plane is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval (mathematics), interval with the property that its epigraph (mathematics), epigraph (the set of points on or above the graph of a function, graph of the function) is a convex set. Convex minimization is a subfield of mathematical optimization, optimization that studies the problem of minimizing convex functions over convex sets. The branch of mathematics devoted to the study of properties of convex sets and convex f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
