Redirect to:
This page is a redirect. The following categories are used to track and monitor this redirect:
|
Look up convex or convexity in Wiktionary, the free dictionary. Convex or convexity may refer to: Convex lens, in optics Convex set, containing the whole...
Click to read more »crescent shape, is not convex. The boundary of a convex set in the plane is always a convex curve. The intersection of all the convex sets that contain a...
Click to read more »In mathematics, a real-valued function is called convex if the line segment between any two distinct points on the graph of the function lies above or...
Click to read more »In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined...
Click to read more »Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently...
Click to read more »Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry...
Click to read more »reflecting. Convex polyhedra are a well-defined class of polyhedra with several equivalent standard definitions. Every convex polyhedron is the convex hull of...
Click to read more »Strictly convex may refer to: Strictly convex function, a function having the line between any two points above its graph Strictly convex polygon, a polygon...
Click to read more »mathematical optimization, the convex conjugate of a function is a generalization of the Legendre transformation which applies to non-convex functions. It is also...
Click to read more »mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any finite set of points. A convex space...
Click to read more »A kinetic convex hull data structure is a kinetic data structure that maintains the convex hull of a set of continuously moving points. It should be distinguished...
Click to read more »Look up plano-convex in Wiktionary, the free dictionary. Plano-convex may refer to: Plano-convex lens, in optics Plano-convex, a type of mudbrick used...
Click to read more »Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves...
Click to read more »A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n {\displaystyle n} -dimensional...
Click to read more »In measure and probability theory in mathematics, a convex measure is a probability measure that — loosely put — does not assign more mass to any intermediate...
Click to read more »In convex geometry and vector algebra, a convex combination is a linear combination of points (which can be vectors, scalars, or more generally points...
Click to read more »Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis,...
Click to read more »the Latin name of the lentil (a seed of a lentil plant), because a double-convex lens is lentil-shaped. The lentil also gives its name to a geometric figure...
Click to read more »In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas:...
Click to read more »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...
Click to read more »In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is...
Click to read more »In mathematics, and particularly convex analysis, the lower convex envelope f ˘ {\displaystyle {\breve {f}}} of a real-valued function f {\displaystyle...
Click to read more »Euclidean space is said to be in convex position or convex independent if none of the points can be represented as a convex combination of the others. A finite...
Click to read more »In economics, convex preferences are an individual's ordering of various outcomes, typically with regard to the amounts of various goods consumed, with...
Click to read more »in a Convex Mirror may refer to: Self-Portrait in a Convex Mirror (Parmigianino), a c. 1524 painting by Parmigianino Self-Portrait in a Convex Mirror...
Click to read more »logarithmically convex or superconvex if log ∘ f {\displaystyle {\log }\circ f} , the composition of the logarithm with f, is itself a convex function. Let...
Click to read more »In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are...
Click to read more »A convex cap is a well defined structure in mathematics commonly used in convex geometry for approximating convex shapes. It is used in the construction...
Click to read more »Convex Computer Corporation was a company that developed, manufactured and marketed vector minisupercomputers and supercomputers for small-to-medium-sized...
Click to read more »boundary of the polygon does not cross itself. All convex polygons are simple. Concave: Non-convex and simple. There is at least one interior angle greater...
Click to read more »non-prismatic convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the convex uniform...
Click to read more »of "convexity" on metric spaces. Karl Menger defined a metric space as convex if any "segment" joining two points in that space has other points in it...
Click to read more »In geometric graph theory, a convex embedding of a graph is an embedding of the graph into a Euclidean space, with its vertices represented as points and...
Click to read more »The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track...
Click to read more »In geometry, a set K ⊂ Rd is defined to be orthogonally convex if, for every line L that is parallel to one of standard basis vectors, the intersection...
Click to read more »Convex and Concave is a lithograph print by the Dutch artist M. C. Escher, first printed in March 1955. It depicts an ornate architectural structure with...
Click to read more »K-convex functions, first introduced by Scarf, are a special weakening of the concept of convex function which is crucial in the proof of the optimality...
Click to read more »The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of sets in a vector space. The lemma may be intuitively...
Click to read more »In mathematics, a Schur-convex function, also known as S-convex, isotonic function and order-preserving function is a function f : R d → R {\displaystyle...
Click to read more »is a mirror with a curved reflecting surface. The surface may be either convex (bulging outward) or concave (recessed inward). Most curved mirrors have...
Click to read more »In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties. A bipartite graph ( U ∪ V , E ) {\displaystyle...
Click to read more »The Convex Mirror is a c 1916 oil with pencil on wood panel painting by Australian artist George Washington Lambert. The work depicts the interior of Belwethers...
Click to read more »An integrally convex set is the discrete geometry analogue of the concept of convex set in geometry. A subset X of the integer grid Z n {\displaystyle...
Click to read more »complex (self-intersecting, or crossed). Simple quadrilaterals are either convex or concave. The interior angles of a simple (and planar) quadrilateral ABCD...
Click to read more »analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces...
Click to read more »strictly convex space is a normed vector space (X, || ||) for which the closed unit ball is a strictly convex set. Put another way, a strictly convex space...
Click to read more »geometry, a convex uniform honeycomb is a uniform tessellation which fills three-dimensional Euclidean space with non-overlapping convex uniform polyhedral...
Click to read more »geodesically convex subset of M. A function f : C → R {\displaystyle f:C\to \mathbf {R} } is said to be a (strictly) geodesically convex function if the...
Click to read more »In metric graph theory, a convex subgraph of an undirected graph G is a subgraph that includes every shortest path in G between two of its vertices. Thus...
Click to read more »authors have studied the computation of the volume of high-dimensional convex bodies, a problem that can also be used to model many other problems in...
Click to read more »cubical cells, meeting at right angles. The tesseract is one of the six convex regular 4-polytopes. The tesseract is also called an 8-cell, C8, (regular)...
Click to read more »In mathematics, uniformly convex spaces (or uniformly rotund spaces) are common examples of reflexive Banach spaces. The concept of uniform convexity was...
Click to read more »mathematics, a convex body in n {\displaystyle n} -dimensional Euclidean space R n {\displaystyle \mathbb {R} ^{n}} is a compact convex set with non-empty...
Click to read more »In mathematics, an invariant convex cone is a closed convex cone in a Lie algebra of a connected Lie group that is invariant under inner automorphisms...
Click to read more »In computational geometry, the convex layers of a set of points in the Euclidean plane are a sequence of nested convex polygons having the points as their...
Click to read more »Local convex hull (LoCoH) is a method for estimating size of the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions...
Click to read more »This definition is valid for any function, but most used for convex functions. A proper convex function is closed if and only if it is lower semi-continuous...
Click to read more »unless the objective function is convex in a minimization problem, there may be several local minima. In a convex problem, if there is a local minimum...
Click to read more »In mathematics, particularly in functional analysis and convex analysis, a convex series is a series of the form ∑ i = 1 ∞ r i x i {\displaystyle \sum...
Click to read more »particular the subfields of convex analysis and optimization, a proper convex function is an extended real-valued convex function with a non-empty domain...
Click to read more »Plano-convex ingots are lumps of metal with a flat or slightly concave top and a convex base. They are sometimes, misleadingly, referred to as bun ingots...
Click to read more »specifically in convex analysis, the convex compactification is a compactification which is simultaneously a convex subset in a locally convex space in functional...
Click to read more »are seven topologically distinct convex hexahedra, one of which exists in two mirror image forms. Additional non-convex hexahedra exist, with their number...
Click to read more »geometry and computational geometry, the relative convex hull or geodesic convex hull is an analogue of the convex hull for the points inside a simple polygon...
Click to read more »(convex, non-stellated) regular icosahedron—one of the Platonic solids—whose faces are 20 equilateral triangles. There are two objects, one convex and...
Click to read more »graph is said to be convex if all of its faces (including the outer face) are convex polygons. Not all planar graphs have a convex embedding (e.g. the...
Click to read more »In graph drawing, a convex drawing of a planar graph is a drawing that represents the vertices of the graph as points in the Euclidean plane and the edges...
Click to read more »Convex Polytopes is a graduate-level mathematics textbook about convex polytopes, higher-dimensional generalizations of three-dimensional convex polyhedra...
Click to read more »infinitely many non-convex deltahedra. A convex polyhedron is made of the intersection of finitely many planes. Of the eight convex deltahedra, three are...
Click to read more »functional analysis, a locally convex vector lattice (LCVL) is a topological vector lattice that is also a locally convex space. LCVLs are important in...
Click to read more »that is topologically equivalent to the dodecahedron. Fifteen types of convex pentagons are known to tile the plane monohedrally (i.e., with one type...
Click to read more »probability that four randomly chosen points in the Euclidean plane form a convex quadrilateral. Together with Buffon's needle problem, it has been called...
Click to read more »or more points are vertices of the convex hull, any four such points can be chosen. If on the other hand, the convex hull has the form of a triangle with...
Click to read more »In mathematics, a convex graph may be a convex bipartite graph a convex plane graph the graph of a convex function This disambiguation page lists articles...
Click to read more »In the field of mathematics known as convex analysis, the indicator function of a set is a convex function that indicates the membership (or non-membership)...
Click to read more »vertex. Many types of irregular octahedra also exist, including both convex and non-convex shapes. The regular octahedron has eight equilateral triangle sides...
Click to read more »Carathéodory's theorem is a theorem in convex geometry. It states that if a point x {\displaystyle x} lies in the convex hull C o n v ( P ) {\displaystyle...
Click to read more »In discrete geometry and computational geometry, the convex hull of a simple polygon is the polygon of minimum perimeter that contains a given simple polygon...
Click to read more »theorem or the hyperplane separation theorem, and has numerous uses in convex geometry. The theorem is named for the mathematicians Hans Hahn and Stefan...
Click to read more »rotational symmetry. Uniform polyhedra can be divided between convex forms with convex regular polygon faces and star forms. Star forms have either regular...
Click to read more »of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of...
Click to read more »on a convex subset of a real vector space, such that for any real number y, the set of points on which the function value is at most y is a convex set...
Click to read more »of stochastic orders.[citation needed] Convex order is a special kind of variability order. Under the convex ordering, A {\displaystyle A} is less than...
Click to read more »economic phenomenon is convex when "intermediates (or combinations) are better than extremes". For example, an economic agent with convex preferences prefers...
Click to read more »superadditivity. Convex games are totally balanced: The core of a convex game is non-empty, and since any subgame of a convex game is convex, the core of...
Click to read more »general enough to be applied to other settings, for example, with other convex loss functions. Consider the setting of supervised learning with f {\displaystyle...
Click to read more »a polytope, but a diagram showing how the elements meet. The classical convex polytopes may be considered tessellations, or tilings, of spherical space...
Click to read more »problems in mathematical programming can be formulated as problems on convex sets or convex bodies. Six kinds of problems are particularly important: optimization...
Click to read more »peeling or convex skull problem is a problem of finding the convex polygon of the largest possible area that lies within a given non-convex simple polygon...
Click to read more »polygons in two dimensions. There are six convex and ten star regular 4-polytopes, giving a total of sixteen. The convex regular 4-polytopes were first described...
Click to read more »equilateral (all sides have the same length). Regular polygons may be either convex or star. In the limit, a sequence of regular polygons with an increasing...
Click to read more »This table shows the 11 convex uniform tilings (regular and semiregular) of the Euclidean plane, and their dual tilings. There are three regular and eight...
Click to read more »subsets, convex cones, and convex sets are generalizations of vector subspaces: a vector subspace is also an affine subspace, a convex cone, and a convex set...
Click to read more »faces. Etymologically, "cuboid" means "like a cube", in the sense of a convex solid which can be transformed into a cube (by adjusting the lengths of...
Click to read more »polytope is a convex polytope whose vertices all have integer Cartesian coordinates. That is, it is a polytope that equals the convex hull of its integer...
Click to read more »with convex sets of geometry, one uses order-convex instead of "convex". A convex sublattice of a lattice L is a sublattice of L that is also a convex set...
Click to read more »Tilings of the Euclidean plane by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of...
Click to read more »which the function value at any convex combination of elements in the domain is greater than or equal to that convex combination of those domain elements...
Click to read more »Johnson solid, sometimes also known as a Johnson–Zalgaller solid, is a convex polyhedron whose faces are regular polygons and that is not a uniform polyhedron...
Click to read more »groups are sometimes regarded as strongly geometric as well. Convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues...
Click to read more »things, the geometrical foundation for generalizing the convex subdifferential to non-convex functions. Of particular note is also their role in generalizing...
Click to read more »mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function. It was proved by Jensen in 1906, building...
Click to read more »Nesterov is a Russian mathematician, an internationally recognized expert in convex optimization, especially in the development of efficient algorithms and...
Click to read more »In mathematics, Minkowski's theorem is the statement that every convex set in R n {\displaystyle \mathbb {R} ^{n}} which is symmetric with respect to the...
Click to read more »usually considered to be a convex quadrilateral in Euclidean geometry, but there are also crossed cases. If shape ABCD is a convex trapezoid, then the ABDC...
Click to read more »In convex analysis and the calculus of variations, both branches of mathematics, a pseudoconvex function is a function that behaves like a convex function...
Click to read more »convex preferences (that do not prefer extremes to in-between values) and convex budget sets and on producers with convex production sets; for convex...
Click to read more »projective plane. No heptahedra are regular. There are 34 topologically distinct convex heptahedra, excluding mirror images. (Two polyhedra are "topologically distinct"...
Click to read more »The regular icosahedron (or simply icosahedron) is a convex polyhedron that can be constructed from a pentagonal antiprism by attaching two pentagonal...
Click to read more »onto convex sets (POCS), sometimes known as the alternating projection method, is a method to find a point in the intersection of two closed convex sets...
Click to read more »Self-Portrait in a Convex Mirror (c. 1524) is a painting by the Italian late Renaissance artist Parmigianino. It is housed in the Kunsthistorisches Museum...
Click to read more »The study of integer points in convex polyhedra is motivated by questions such as "how many nonnegative integer-valued solutions does a system of linear...
Click to read more »The convex-billed cowbird (Pandanaris convexa) is an extinct species of bird in the family Icteridae, described in 1947 by Alden H. Miller. It is the only...
Click to read more »In the mathematical area of game theory and of convex optimization, a minimax theorem is a theorem that claims that max x ∈ X min y ∈ Y f ( x , y ) = min...
Click to read more »spheres determines a specific volume known as the convex hull of the packing, defined as the smallest convex set that includes all the spheres. There are many...
Click to read more »equal circles arranged in a closed chain are sufficient to determine a convex equilateral pentagon. Each circle's center is one of four vertices of the...
Click to read more »down to a point if the sides aligned with every axis have length zero. A convex polygon is degenerate if at least two consecutive sides coincide at least...
Click to read more »Toronto International Film Festival and was bought for distribution by Convex Group, owners of the Flexplay disposable DVD technology. Flexplay disks...
Click to read more »simple polygon (non-self-intersecting), regardless of whether it is convex or non-convex, this angle is called an internal angle (or interior angle) if a...
Click to read more »In functional analysis, the class of B-convex spaces is a class of Banach space. The concept of B-convexity was defined and used to characterize Banach...
Click to read more »that point. Subderivatives arise in convex analysis, the study of convex functions, often in connection to convex optimization. Let f : I → R {\displaystyle...
Click to read more »geometry Conical hull, in convex geometry Convex hull, in convex geometry Carathéodory's theorem (convex hull) Holomorphically convex hull, in complex analysis...
Click to read more »reflected as if it came from the other. Diverging (negative) lenses and convex mirrors do not focus a collimated beam to a point. Instead, the focus is...
Click to read more »geometric object that was discovered by Paul Schatz in 1929. It is the convex hull of a skeletal frame made by placing two linked congruent circles in...
Click to read more »\mathbf {x} \in \mathbf {X} } is the optimization variable chosen from a convex subset of R n {\displaystyle \mathbb {R} ^{n}} , f {\displaystyle f} is...
Click to read more »topology and convex geometry about sequences of convex sets. Specifically, given a sequence { K n } {\displaystyle \{K_{n}\}} of convex sets contained...
Click to read more »compact convex sets in locally convex topological vector spaces (TVSs). Krein–Milman theorem—A compact convex subset of a Hausdorff locally convex topological...
Click to read more »forming convex hulls are commuting operations. If S {\textstyle S} is a convex set then μ S + λ S {\displaystyle \mu S+\lambda S} is also a convex set; furthermore...
Click to read more »number of convex corners and Y the number of concave corners. By the previous fact, X=Y+4. Let XX the number of convex corners followed by a convex corner...
Click to read more »In geometry, a composite polyhedron is a convex polyhedron that produces two convex, regular-faced polyhedra when sliced by a plane.[dubious – discuss]...
Click to read more »barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs combine two advantages of previously-known algorithms:...
Click to read more »categories of TVSs are locally convex topological vector spaces. This article focuses on TVSs that are not necessarily locally convex. Other well-known examples...
Click to read more »LSE and use this formula internally. LSE is convex but not strictly convex. We can define a strictly convex log-sum-exp type function by adding an extra...
Click to read more »instead of the sublinear property,R is convex, then R is a set-valued convex risk measure. A lower semi-continuous convex risk measure ϱ {\displaystyle \varrho...
Click to read more »real-valued functions that are convex on a real variable. Specifically, if a real-valued multivariable function is convex on one of its independent real...
Click to read more »three regular star dodecahedra, which are constructed as stellations of the convex form. All of these have icosahedral symmetry, order 120. Some dodecahedra...
Click to read more »The convex horseshoe bat (Rhinolophus convexus) is a species of bat in the family Rhinolophidae. It is found in Malaysia and Laos. This species was first...
Click to read more »assumptions on the function f {\displaystyle f} (for example, f {\displaystyle f} convex and ∇ f {\displaystyle \nabla f} Lipschitz) and particular choices of η...
Click to read more »containers. Conversely, a convex meniscus occurs when the adhesion energy is less than half the cohesion energy. For example, convex menisci occur between...
Click to read more »are convex. With this terminology, a convex polyhedron is the intersection of a finite number of halfspaces and is defined by its sides while a convex polytope...
Click to read more »for uniformly convex Banach spaces. It asserts that if K {\displaystyle K} is a nonempty convex closed bounded set in uniformly convex Banach space and...
Click to read more »3-space; similarly the 3D cube is related to the infinite 2D square tiling. Convex 4-polytopes can be cut and unfolded as nets in 3-space. A 4-polytope is...
Click to read more »and convex angle. Concave angles have slightly concave sides and open to the medial (inner) area of the tusk. Convex angles have somewhat convex sides...
Click to read more »Unsolved problem in mathematics Is there any three-dimensional convex body with lower packing density than the sphere? More unsolved problems in mathematics...
Click to read more »(MILP) problems, as well as to solve general, not necessarily differentiable convex optimization problems. The use of cutting planes to solve MILP was introduced...
Click to read more »foci (or focal points) of the lens. For a converging lens (for example a convex lens), the focal length is positive and is the distance at which a beam...
Click to read more »class of polyhedra with six quadrilateral faces. A rectangular cuboid is a convex polyhedron with six rectangle faces. The dihedral angles of a rectangular...
Click to read more »connected to form a convex polyhedron called its convex hull. A compound is a faceting of its convex hull.[citation needed] Another convex polyhedron is formed...
Click to read more »In mathematics, the support function hA of a non-empty closed convex set A in R n {\displaystyle \mathbb {R} ^{n}} describes the (signed) distances of...
Click to read more »used to solve non-differentiable convex optimization problems. Many interesting problems can be formulated as convex optimization problems of the form...
Click to read more »A simple polygon that is not convex is called concave, non-convex or reentrant. A concave polygon will always have at least one reflex interior angle—that...
Click to read more »geometric transformation that, when applied to a convex polyhedron, realizes the dual polyhedron as another convex polyhedron. There are many kinds of duality...
Click to read more »finite-dimensional objects, such as convex bodies and normed spaces, as the dimension tends to infinity. It is at the intersection of convex geometry and functional...
Click to read more »for boosting. Boosting algorithms can be based on convex or non-convex optimization algorithms. Convex algorithms, such as AdaBoost and LogitBoost, can...
Click to read more »In geometry, a zonogon is a centrally-symmetric, convex polygon. Equivalently, it is a convex polygon whose sides can be grouped into parallel pairs with...
Click to read more »analysis and related areas of mathematics a dual topology is a locally convex topology on a vector space that is induced by the continuous dual of the...
Click to read more »symmetry of order 5 (through 72°, 144°, 216° and 288°). The diagonals of a convex regular pentagon are in the golden ratio to its sides. Given its side length...
Click to read more »In mathematics, Minkowski's first inequality for convex bodies is a geometrical result due to the German mathematician Hermann Minkowski. The inequality...
Click to read more »the convex relaxation of the primal problem: The convex relaxation is the problem arising replacing a non-convex feasible set with its closed convex hull...
Click to read more »particularly if it is not convex. Every kite is an orthodiagonal quadrilateral (its diagonals are at right angles) and, when convex, a tangential quadrilateral...
Click to read more »A magnifying glass is a convex lens—usually mounted in a frame with a handle—that is used to produce a magnified image of an object. A magnifying glass...
Click to read more »non-expansive maps is closed under convex combinations, but not compositions. This class includes proximal mappings of proper, convex, lower-semicontinuous functions...
Click to read more »difference bound matrix (DBM) is a data structure used to represent some convex polytopes called zones. This structure can be used to efficiently implement...
Click to read more »where f is a bounded function and g is a convex function. MMO problems play a central role in game theory, convex optimization and online machine learning...
Click to read more »either convex (bending outward) or concave (bending inward). The intersection of three disks forms a circular triangle whose sides are all convex. An example...
Click to read more »the convex cone of positive semi-definite matrices. This order is usually employed to generalize the definitions of monotone and concave/convex scalar...
Click to read more »The polynomially convex hull contains the holomorphically convex hull. The domain G {\displaystyle G} is called holomorphically convex if for every compact...
Click to read more »within the convex hull of the roots of P, that is the smallest convex polygon containing the roots of P. When P has a single root then this convex hull is...
Click to read more »positive definite, the problem is a special case of the more general field of convex optimization. Quadratic programming is particularly simple when Q is positive...
Click to read more »In geometry, a developable roller is a convex solid whose surface consists of a single continuous, developable face. While rolling on a plane, most developable...
Click to read more »In Euclidean plane geometry, a rectangle is a rectilinear convex polygon or a quadrilateral with four right angles. It can also be defined as: an equiangular...
Click to read more »polyhedral combinatorics (the study of faces of convex polyhedra), convex geometry (the study of convex sets, in particular combinatorics of their intersections)...
Click to read more »National Book Critics Circle Award for his collection Self-Portrait in a Convex Mirror (1975). In 2007, he became the first living poet to be anthologized...
Click to read more »space R n {\displaystyle \mathbb {R} ^{n}} and K {\displaystyle K} is a convex centrally symmetric body. Minkowski's theorem, sometimes called Minkowski's...
Click to read more »A gömböc (Hungarian: [ˈɡømbøt͡s]) is any member of a class of convex, three-dimensional and homogeneous bodies that are mono-monostatic, meaning that they...
Click to read more »or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles whose circumcircles do not contain any of the points;...
Click to read more »In convex analysis, Popoviciu's inequality is an inequality about convex functions. It is similar to Jensen's inequality and was found in 1965 by Tiberiu...
Click to read more »Antimatroids are equivalent, by complementation, to convex geometries, a combinatorial abstraction of convex sets in geometry. Antimatroids have been applied...
Click to read more »over the real or complex numbers that at the same time is also a (locally convex) Fréchet space. The multiplication operation ( a , b ) ↦ a ∗ b {\displaystyle...
Click to read more »algorithm used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only vertices from the subject polygon...
Click to read more »In geometry, the 5-cell is the convex 4-polytope with Schläfli symbol {3,3,3}. It is a 5-vertex four-dimensional object bounded by five tetrahedral cells...
Click to read more »the perception of a concave mask of a face appears as a normal convex face. While a convex face will appear to look in a single direction, and the gaze...
Click to read more »Self-Portrait in a Convex Mirror is a 1975 poetry collection by the American writer John Ashbery. The title, shared with its final poem, comes from the...
Click to read more »regular. An equilateral quadrilateral must be convex; this polygon is a rhombus (possibly a square). A convex equilateral pentagon can be described by two...
Click to read more »Generalizations of the Farkas' lemma are about the solvability theorem for convex inequalities, i.e., infinite system of linear inequalities. Farkas' lemma...
Click to read more »algorithm for constrained convex optimization. Also known as the conditional gradient method, reduced gradient algorithm and the convex combination algorithm...
Click to read more »mathematics known as functional analysis, a reflexive space is a locally convex topological vector space for which the canonical evaluation map from X {\displaystyle...
Click to read more »Dual polyhedron article.) The dual of a convex polyhedron is also a convex polyhedron. There are nine convex isotoxal polyhedra based on the Platonic...
Click to read more »In convex analysis and optimization, the normal cone to a set at a point is a convex cone consisting of vectors that make a non-acute angle with every...
Click to read more »theorem about ovals states that the area cut off by a secant of a smooth convex oval is not an algebraic function of the secant. Isaac Newton stated it...
Click to read more »linear functions include the continuous piecewise linear functions and the convex piecewise linear functions. In general, for every n-dimensional continuous...
Click to read more »non-positive curvature and by Alexander & Bishop (1990) for general locally convex metric spaces. The Cartan–Hadamard theorem in conventional Riemannian geometry...
Click to read more »In mathematics, an extreme point of a convex set S {\displaystyle S} in a real or complex vector space or affine space is a point in S {\displaystyle S}...
Click to read more »rhombic dodecahedron is a convex polyhedron with 12 congruent rhombi as its faces. The rhombic triacontahedron is a convex polyhedron with 30 golden rhombi...
Click to read more »driver-side mirror to have a planar, convex, or aspheric surface; an aspheric section is often combined with a larger convex section, and the two sections are...
Click to read more »optimality-criteria are convex (or concave) functions, and therefore optimal-designs are amenable to the mathematical theory of convex analysis and their computation...
Click to read more »shape is allowed. Polyominoes are examples of tiles that are either convex of non-convex, for which various combinations, rotations, and reflections can be...
Click to read more »as the majorization inequality, is a theorem in elementary algebra for convex and concave real-valued functions, defined on an interval of the real line...
Click to read more »(Tychonoff) fixed-point theorem: Let V be a locally convex topological vector space. For any nonempty compact convex set X in V, any continuous function f : X →...
Click to read more »In plane geometry, a lune (from Latin luna 'moon') is the concave-convex region bounded by two circular arcs. It has one boundary portion for which the...
Click to read more »commuting family of continuous affine self-mappings of a compact convex subset in a locally convex topological vector space has a common fixed point. This theorem...
Click to read more »self-concordant function, that is also a barrier function for a particular convex set. Self-concordant barriers are important ingredients in interior point...
Click to read more »Safety Standards, Section 571.111 S5.4.2. Retrieved 8 March 2023. "Each convex mirror shall have permanently and indelibly marked at the lower edge of...
Click to read more »antiprisms, the convex polyhedrons as in 5 Platonic solids and 13 Archimedean solids—2 quasiregular and 11 semiregular— the non-convex star polyhedra as...
Click to read more »Kirkpatrick–Seidel algorithm is an algorithm designed for computing the convex hull of a set of points in the plane, offering a time complexity of O (...
Click to read more »linear equality and linear inequality constraints. Its feasible region is a convex polytope, which is a set defined as the intersection of finitely many half...
Click to read more »structure whose definable sets in the domain are just finite unions of convex sets. A linearly ordered structure, M, with language L including an ordering...
Click to read more »radial basis is sometimes used. Then a convex set is assigned to the parameter vector, and the size of the convex set is minimized such that every possible...
Click to read more »convex shape in the plane that can cover any shape of diameter one Mahler's conjecture on the product of the volumes of a centrally symmetric convex body...
Click to read more »point where the function changes from being concave (concave downward) to convex (concave upward), or vice versa. For the graph of a function f of differentiability...
Click to read more »mathematics, more specifically, in convex geometry, the mixed volume is a way to associate a non-negative number to a tuple of convex bodies in R n {\displaystyle...
Click to read more »and }}\qquad C_{r}(x):=\{z\in X\mid \|z-x\|\leq r\}.} Any such ball is a convex and bounded subset of X , {\displaystyle X,} but a compact ball/neighborhood...
Click to read more »region that is not fully convex can be modified to enclose more area, by "flipping" the concave areas so that they become convex. It can further be shown...
Click to read more »{\displaystyle \kappa } copies of the intervals. The concepts of convex sets and convex components are used in a proof that every totally ordered set endowed...
Click to read more »during the Akkadian period. The Plano-convex building was a fortified construction built extensively with plano-convex bricks. It displayed the socio-economic...
Click to read more »linear algebra, a power cone is a kind of a convex cone that is particularly important in modeling convex optimization problems. It is a generalization...
Click to read more »Convex analysis Convex cone Convex function Convex set Legendre–Fenchel transformation Convex minimization Fenchel's duality theorem Geometry Convex geometry...
Click to read more »In the geometry of convex polyhedra, blooming or continuous blooming is a continuous three-dimensional motion of the surface of the polyhedron, cut to...
Click to read more »case could first give me by its perfect apparition, when I was with two convexes trying experiments about the sun, the unexpected knowledge...if I .......
Click to read more »the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates a sequence of ellipsoids...
Click to read more »contributions in this field. In 1995 Toponogov made the conjecture: On a complete convex surface S homeomorphic to a plane the following equality holds: inf p ∈...
Click to read more »The convex-tailed horned toad (Boulenophrys caudoprocta) is a species of frog in the family Megophryidae, endemic to China, and is only known from the...
Click to read more »concentrate on consumers with convex preferences and convex budget sets and on producers with convex production sets; for convex models, the predicted economic...
Click to read more »In mathematics, specifically convex geometry, the normal fan of a convex polytope P is a polyhedral fan that is dual to P. Normal fans have applications...
Click to read more »polytope is projectively unique (or projectively stable) if it has a unique convex realization up to projective transformations. The study of projectively...
Click to read more »the candles (possibly omitted from the painting for lack of room). The convex mirror at the back, in a wooden frame with scenes of The Passion painted...
Click to read more »been proposed that use regions that are general convex polygons, not necessarily rectangular. Convex treemaps were developed in several steps, each step...
Click to read more »polyhedra. They may be obtained by stellating and faceting the regular convex dodecahedron and icosahedron, and differ from these in having regular pentagrammic...
Click to read more »In geometry, the rhombic dodecahedron is a convex polyhedron with 12 congruent rhombic faces. It has 24 edges, and 14 vertices of 2 types. As a Catalan...
Click to read more »utility function. Theorem 1 (Varian): If the preferences of all agents are convex and strongly monotone, then PEEF allocations exist. Proof: The proof relies...
Click to read more »geometry, the hyperplane separation theorem is a theorem about disjoint convex sets in n-dimensional Euclidean space. There are several rather similar...
Click to read more »(1923–2004) was an American mathematician, specializing in the geometry of convex bodies. Born in Montana, Firey moved with his family to Seattle when he...
Click to read more »In mathematics, particularly, in asymptotic convex geometry, Milman's reverse Brunn–Minkowski inequality is a result due to Vitali Milman that provides...
Click to read more »1\right\}.} Conversely: Any locally convex topological vector space has a local basis consisting of absolutely convex sets. A common method to construct...
Click to read more »Each category contains methods designed for dealing with convex, non-smooth, and non-convex problems, each differing in hyper-parameter settings and other...
Click to read more »Brunn–Minkowski theorem (Hermann Brunn 1887; Hermann Minkowski 1896) applied to convex sets; the generalization to compact nonconvex sets stated here is due to...
Click to read more »three-dimensional convex polyhedra and higher-dimensional convex polytopes. It states that, if one forms an undirected graph from the vertices and edges of a convex d-dimensional...
Click to read more »measure of difference between two points, defined in terms of a strictly convex function; they form an important class of divergences. When the points are...
Click to read more »numbers, Ehrhart's volume conjecture gives an upper bound on the volume of a convex body containing only one lattice point in its interior. It is a kind of...
Click to read more »or very slightly convex. The forewing upperside ground colour is light brown with a straight brown postmedian line, two slightly convex basal lines and...
Click to read more »mathematics, the Chambolle–Pock algorithm is an algorithm used to solve convex optimization problems. It was introduced by Antonin Chambolle and Thomas...
Click to read more »also written (DF)-spaces are locally convex topological vector space having a property that is shared by locally convex metrizable topological vector spaces...
Click to read more »sets of G {\displaystyle {\mathcal {G}}} is a method to define locally convex topologies on the vector spaces of a pairing. A pairing is a triple ( X...
Click to read more »In geometry, a Blind polytope is a convex polytope composed of regular polytope facets. The category was named after the German couple Gerd and Roswitha...
Click to read more »geometry, the rhombicosidodecahedron is an Archimedean solid, one of thirteen convex isogonal nonprismatic solids constructed of two or more types of regular...
Click to read more »in a projective space of dimension n. A convex basis of a polytope is the set of the vertices of its convex hull. A cone basis consists of one point...
Click to read more »f(t)} is convex, so is A ↦ Tr f ( A ) {\displaystyle A\mapsto \operatorname {Tr} f(A)} on Hn, and it is strictly convex if f is strictly convex. See proof...
Click to read more »spaces. A Fréchet space X {\displaystyle X} is defined to be a locally convex metrizable topological vector space (TVS) that is complete as a TVS, meaning...
Click to read more »that a non-convex simple polygon can be made into a convex polygon by a finite sequence of flips. The flips are defined by taking a convex hull of a polygon...
Click to read more »Mathematics at the University of Vienna. Boț's research focuces on convex analysis, convex optimization, nonsmooth optimization, and monotone operators. His...
Click to read more »of Engineering for contributions to engineering design and analysis via convex optimization. Boyd received an B.A. degree in mathematics, summa cum laude...
Click to read more »regular convex 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,3,4}. It is one of the six regular convex 4-polytopes...
Click to read more »to locally convex topological vector spaces, which may be of infinite dimension. It asserts that if K {\displaystyle K} is a nonempty convex closed subset...
Click to read more »In convex geometry, a spectrahedron is a shape that can be represented as a linear matrix inequality. Alternatively, the set of n × n positive semidefinite...
Click to read more »need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some absorbing disk...
Click to read more »boundary. In most work on this problem, D {\displaystyle D} is additionally a convex set of nonzero area. When three of the placed points lie on a line, they...
Click to read more »In six-dimensional geometry, a pentic 6-cube is a convex uniform 6-polytope. There are 8 pentic forms of the 6-cube. The pentic 6-cube, , has half of the...
Click to read more »geometry, the gift wrapping algorithm is an algorithm for computing the convex hull of a given set of points. In the two-dimensional case the algorithm...
Click to read more »at New York University in New York City. His main research interests are convex geometry and its connections with analysis and information theory. Gaoyong...
Click to read more »projective metric, is an explicitly defined distance function on a bounded convex subset of the n-dimensional Euclidean space Rn. It was introduced by David...
Click to read more »heptagonal antiprism. There are 387,591,510,244 topologically distinct convex hexadecahedra, excluding mirror images, having at least 10 vertices. (Two...
Click to read more »polyhedral combinatorics, the Kleetope of a polyhedron or higher-dimensional convex polytope P is another polyhedron or polytope PK formed by replacing each...
Click to read more »the perimeter of the convex hull of S. So w is the diameter of a circle with the same perimeter as the convex hull. For convex bodies K in three dimensions...
Click to read more »Convex preferences relate to averages between two points on an indifference curve. It comes in two forms, weak and strong. In its weak form, convex preferences...
Click to read more »problem), or convex (minimization problem) and the constraint set is convex, then the program is called convex and general methods from convex optimization...
Click to read more »-Lipschitz gradient. When every f i {\displaystyle f_{i}} is convex the function is convex, and an ε {\displaystyle \varepsilon } -optimal point is reachable...
Click to read more »tumbler. One such theory is that the glass originally had a pointed or convex base and could not be set down without spilling. Another is that they had...
Click to read more »4-element orthoscopic eyepiece consists of a plano-convex singlet eye lens and a cemented convex-convex triplet field lens achromatic field lens. This gives...
Click to read more »In mathematics, Tarski's plank problem is a question about coverings of convex regions in n-dimensional Euclidean space by "planks": regions between two...
Click to read more »In convex geometry, a zonoid is a type of centrally symmetric convex body. The zonoids have several definitions, equivalent up to translations of the...
Click to read more »also convex. If S 1 , S 2 {\displaystyle S_{1},S_{2}} are convex and relatively open sets, then S 1 + S 2 {\displaystyle S_{1}+S_{2}} is convex and relatively...
Click to read more »is convex. For example, {3} is an equilateral triangle, {4} is a square, {5} a convex regular pentagon, etc. Regular star polygons are not convex, and...
Click to read more »origin and every convex neighborhood of the origin contains a balanced convex neighborhood of the origin (even if the TVS is not locally convex). This neighborhood...
Click to read more »Capunti is a type of short convex oval pasta resembling an open empty pea pod. Media related to Capunti at Wikimedia Commons Italy portal Food portal List...
Click to read more »In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the...
Click to read more »of anisohedral convex polygons, showing that there were no anisohedral convex hexagons but being unable to show there were no such convex pentagons, while...
Click to read more »various restrictions on f-vectors of convex simplicial polytopes, to this more general setting. The face lattice of a convex polytope, consisting of its faces...
Click to read more »terminology, a bounded polyhedron is called a polytope. Analytically, a convex polyhedron is expressed as the solution set for a system of linear inequalities...
Click to read more »double lattice packing density of any convex set, and more generally for the optimal packing density of any convex set. Some 1000-kwacha coins from Zambia...
Click to read more »substriatus is grayish or brownish in color and slimy when wet. It is conical to convex and about 3.8-5.2 centimeters in diameter. The stipe is about 5-12 centimeters...
Click to read more »finitely many line segments. These polygons include as special cases the convex polygons, star-shaped polygons, and monotone polygons. The sum of external...
Click to read more »: X → R {\displaystyle p\colon X\to \mathbb {R} } which is subadditive, convex, and satisfies p ( 0 ) ≤ 0 {\displaystyle p(0)\leq 0} is also positively...
Click to read more »geometry Conformal geometry Constructive solid geometry Contact geometry Convex geometry Descriptive geometry Differential geometry Digital geometry Discrete...
Click to read more »edges, faces or facets of the object. In a polygon, a vertex is called "convex" if the internal angle of the polygon (i.e., the angle formed by the two...
Click to read more »F} (follows by construction of the duality gap) F {\displaystyle F} is convex and lower semi-continuous (equivalent to the first point by the Fenchel–Moreau...
Click to read more »icosahedron, sometimes called Jessen's orthogonal icosahedron, is a non-convex polyhedron with the same numbers of vertices, edges, and faces as the regular...
Click to read more »4-dimensional tesseract has 24 square faces, each sharing two of 8 cubic cells. Any convex polyhedron's surface has Euler characteristic V − E + F = 2 , {\displaystyle...
Click to read more »theorem is a result in convex analysis named after French mathematician Jean-Jacques Moreau. It shows that sufficiently well-behaved convex functionals on Hilbert...
Click to read more »polygon into convex polygons, several objectives have been studied. The optimal convex partitioning problem is to partition a non-convex polygon into...
Click to read more »\mathbb {R} ^{n}} is called a star domain (or star-convex set, star-shaped set or radially convex set) if there exists an s 0 ∈ S {\displaystyle s_{0}\in...
Click to read more »It provides sufficient conditions for a set-valued function defined on a convex, compact subset of a Euclidean space to have a fixed point, i.e. a point...
Click to read more »In six-dimensional geometry, a stericated 6-simplex is a convex uniform 6-polytope with 4th order truncations (sterication) of the regular 6-simplex. There...
Click to read more »semidefinite, then the problem is convex. If these matrices are neither positive nor negative semidefinite, the problem is non-convex. If P1, ... ,Pm are all zero...
Click to read more »and usually curved: the concave side is used as a wok or frying pan, the convex side for cooking flatbreads and pancakes. There are also flat tawas. The...
Click to read more »shaped and polished, as opposed to faceted. The resulting form is usually a convex (rounded) obverse with a flat reverse. Cabochon was the default method of...
Click to read more »The Curmsun Disc is a purportedly Viking Age convex-concave gold disc that gained scholarly attention in 2014. The disc, which is apparently dedicated...
Click to read more »Gomphidius maculatus measures 2–9 cm in diameter and is initially convex, becoming plano-convex or flattened with maturity. Sometimes it may develop a slight...
Click to read more »bounding box of a point set is the same as the minimum bounding box of its convex hull, a fact which may be used heuristically to speed up computation. In...
Click to read more »Argentine mathematician who works on optimization and analysis (particularly: convex analysis, functional analysis and non-smooth analysis). Currently, she is...
Click to read more »Different convex sets yield different seminorms, and every asymmetric seminorm on R n {\displaystyle \mathbb {R} ^{n}} can be obtained from some convex set...
Click to read more »the study of complex vector spaces, a set S is said to be polynomially convex if, for every point x outside of S, there exists a polynomial whose complex...
Click to read more »piece from a figure, its area decreases but its perimeter may not. The convex hull of a figure may be visualized as the shape formed by a rubber band...
Click to read more »caveat: many terms in Riemannian and metric geometry, such as convex function, convex set and others, do not have exactly the same meaning as in general...
Click to read more »special case for n = 4 is known as a tesseract. It is a closed, compact, convex figure whose 1-skeleton consists of groups of opposite parallel line segments...
Click to read more »classified it as Conocybe affinis. Cap: (5) 7-12 (20)mm wide, semiglobose to convex or campanulate. The surface is uniformly light brown or tan but fades with...
Click to read more »360°, while interior angles in a triangle add up to 180°. However, on a convex polyhedron, the angles of the faces meeting at a vertex add up to less than...
Click to read more »triangles as faces. is the dual polyhedron to the cube and one of eight convex deltahedra. The stella octangula, or eight-pointed star, is the only stellation...
Click to read more »through the following diagram: f convex ⟹ f polyconvex ⟹ f quasiconvex ⟹ f rank-one convex {\displaystyle f{\text{ convex}}\implies f{\text{ polyconvex}}\implies...
Click to read more »vertices, and nonregular hexagonal faces. There are 3 types of monohedral convex hexagonal tilings. They are all isohedral. Each has parametric variations...
Click to read more »the intersection of convex sets, and is a variant of the alternating projection method (also called the projections onto convex sets method). In its...
Click to read more »The hexapentakis truncated icosahedron is a convex polyhedron constructed as an augmented truncated icosahedron. It is a geodesic polyhedron {3,5+}3,0...
Click to read more »vertex-transitive, and all facets are uniform 5-polytopes. The complete set of convex uniform 6-polytopes has not been determined, but most can be made as Wythoff...
Click to read more »of convex optimization that studies problems consisting of minimizing a convex function over the intersection of an affine subspace and a convex cone...
Click to read more »centimeters in diameter. It becomes browner in color as it gets older. It is convex to flat and sometimes depressed. The gills are pale to pinkish and adnate...
Click to read more »structure as a regular octahedron, but with dihedral angles that are non-convex along three disjoint edges. Because it has no interior diagonals, it cannot...
Click to read more »functions f : X → E {\displaystyle f\colon X\to E} with values in some locally convex space E {\displaystyle E} (1975 Rybakov, 1981 Blondia, 2015 Beckmann and...
Click to read more »theorem on convex sets, published by Johann Radon in 1921, states that: Any set of d + 2 points in Rd can be partitioned into two sets whose convex hulls intersect...
Click to read more »In six-dimensional geometry, a steric 6-cube is a convex uniform 6-polytope. There are unique 4 steric forms of the 6-cube. Runcinated demihexeract Runcinated...
Click to read more »In geometry, a star polygon is a type of non-convex polygon. Regular star polygons have been studied in depth; while star polygons in general appear not...
Click to read more »Convex Polyhedra is a book on the mathematics of convex polyhedra, written by Soviet mathematician Aleksandr Danilovich Aleksandrov, and originally published...
Click to read more »found on lawns. It is not edible. The cap is 1 to 4 cm across, conic to convex, hygrophanous with a brownish colour when moist and tannish when dry, often...
Click to read more »-hedron, the name becomes Hendecahedron. In all the convex hendecahedra, there are a total of 440,564 convex ones with distinct differences in topology. There...
Click to read more »2024). "ServiceTitan Acquires Convex". FinSMEs. Retrieved November 26, 2025. "ServiceTitan to Acquire Software Firm Convex | ACHR News". www.achrnews.com...
Click to read more »quadrilateral has two diagonals, joining opposite pairs of vertices. For any convex polygon, all the diagonals are inside the polygon, but for re-entrant polygons...
Click to read more »polygon which is half-orthogonally convex (i.e. only in the x direction), a minimum covering by orthogonally convex polygons can be found in time O(n^2)...
Click to read more »combinations and hulls may be considered as convex combinations and convex hulls in the projective space. While the convex hull of a compact set is also a compact...
Click to read more »Equivalently, a line segment is the convex hull of two points. Thus, the line segment can be expressed as a convex combination of the segment's two end...
Click to read more »moderate to strong curve along its length. The cutting edge was only on the convex side of the blade, unlike the guisarme or bill. The fauchard was likely...
Click to read more »Swedish mathematician who worked on complex analysis, continuous groups, convex sets, set-valued analysis, and game theory. From 1952, he was lektor (assistant...
Click to read more »curvature, combining the convex ovolo and concave cavetto. When the concave part is uppermost, it is called a cyma recta but if the convex portion is at the...
Click to read more »Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald Graham...
Click to read more »geometry, a lens is a convex region bounded by two circular arcs joined to each other at their endpoints. In order for this shape to be convex, both arcs must...
Click to read more »constructed from a triangular tiling extruded into prisms. It is one of 28 convex uniform honeycombs. It consists of 1 + 6 + 1 = 8 edges meeting at a vertex...
Click to read more »Horses of the Alter Real strain are always brown. Members of the breed have convex facial profiles, heavy muscling, intelligent and willing natures, with agile...
Click to read more »imperforate, yellowish-white shell has a conical shape with a convex base, . The six convex whorls are separated by a deep suture, which is waved by the...
Click to read more »faces. It has 10p edges, and 4p vertices. There is an infinite series of convex uniform antiprismatic prisms, starting with the digonal antiprismatic prism...
Click to read more »Characterization of normable spaces Locally convex topological vector space – a vector space with a topology defined by convex open sets Space (mathematics) – mathematical...
Click to read more »closo-boranate ion [B11H11]2−. There are 107,854,282,197,058 topologically distinct convex octadecahedra, excluding mirror images, having at least 11 vertices. (Two...
Click to read more »Some fundamental problems of this type are: Convex hull: Given a set of points, find the smallest convex polyhedron/polygon containing all the points...
Click to read more »3-space that preserve the tiling] is transitive on vertices). There are 28 convex examples in Euclidean 3-space, also called the Archimedean honeycombs. A...
Click to read more »{\displaystyle J_{87}} There are 6,415,851,530,241 topologically distinct convex heptadecahedra, excluding mirror images, having at least 11 vertices. (Two...
Click to read more »The Archimedean solids are a set of thirteen convex polyhedra whose faces are regular polygons and are vertex-transitive,[citation needed] although they...
Click to read more »{\displaystyle \mathbb {Z} ^{d},d\geq 0} . Affine monoids are closely connected to convex polyhedra, and their associated algebras are of much use in the algebraic...
Click to read more »Some other names for specific types of raised pavement markers include convex vibration lines, Botts' dots, delineators, cat's eyes, road studs, or road...
Click to read more »(probably 'Webbiana'). Convex-leaved field elm, St James's Church, Charlotte Street, Leith Stems of same Foliage of same Convex-leaved field elm, East...
Click to read more »generalization of the concept of the convex hull, i.e. every convex hull is an alpha-shape but not every alpha shape is a convex hull. For each real number α...
Click to read more »3-dimensional hyperbolic space there are nine Coxeter group families of compact convex uniform honeycombs, generated as Wythoff constructions, and represented...
Click to read more »In eight-dimensional geometry, a cantellated 8-simplex is a convex uniform 8-polytope, being a cantellation of the regular 8-simplex. There are six unique...
Click to read more »Pitcher, with a ritual hunt scene, is a polished, black, convex, short-neck pitcher. It is kept in the History Museum of Armenia under the number 1919-1...
Click to read more »on finite unions of convex bodies of R n . {\displaystyle \mathbb {R} ^{n}.} Other examples of valuations on finite unions of convex bodies of R n {\displaystyle...
Click to read more »more specifically in polyhedral combinatorics, a Goldberg polyhedron is a convex polyhedron made from hexagons and pentagons. They were first described in...
Click to read more »the need for showing that arbitrary curves become convex and separately studying the behavior of convex curves. Their results can also be extended to settings...
Click to read more »The quotient of a locally convex space by a closed subspace is again locally convex. Indeed, suppose that X is locally convex so that the topology on X...
Click to read more »(convex hull) - If a point x of Rd lies in the convex hull of a set P, there is a subset of P with d+1 or fewer points such that x lies in its convex hull...
Click to read more »of the box. It is sufficient to find the smallest enclosing box for the convex hull of the objects in question. It is straightforward to find the smallest...
Click to read more »mutually tangent convex sets. Thus, it is a shape bounded by three inward-curved sides, formed by the boundaries of these three convex sets. A pseudotriangulation...
Click to read more »cap of Hebeloma velutipes is about 2-6 centimeters in diameter and can be convex or umbonate. Its color is variable, and it can be pale, white, or brown...
Click to read more »about 8 mm. They are broadly oval, convex, light ferruginous. The antennae re testaceous. The thorax is uniformly convex and surrounded with a narrow black...
Click to read more »compound can be connected to form a convex polytope called the convex hull. The compound is a facetting of the convex hull. In 5-polytope compounds constructed...
Click to read more »In geometry, the elongated square pyramid is a convex composite polyhedron constructed by attaching the square base of an equilateral square pyramid to...
Click to read more »absorption property in function spaces as well as from compact convex co-convex subsets of a convex set. An example of cap sets comes from the card game Set...
Click to read more »define locally convex polar topologies on the vector spaces in a dual pair, as the polar set of a bounded set is an absolutely convex and absorbing set...
Click to read more »the problem has a convex objective function that is to be minimized, it will generally be easier to solve in the presence of a convex feasible set and...
Click to read more »geometry, a rhombicuboctahedral prism is a convex uniform polychoron (four-dimensional polytope). It is one of 18 convex uniform polyhedral prisms created by...
Click to read more »the trapezo-rhombic dodecahedron or rhombo-trapezoidal dodecahedron is a convex dodecahedron with 6 rhombic and 6 trapezoidal faces. It has D3h symmetry...
Click to read more »and four vertices. The tetrahedron is the simplest of all the ordinary convex polyhedra. The tetrahedron is the three-dimensional case of the more general...
Click to read more »In geometry, the gyroelongated pentagonal rotunda is a Johnson solid, a convex polyhedron with thirty equilateral triangles, six regular pentagons, and...
Click to read more »region. In some variations of the problem, the region is restricted to be convex. For example, a circular disk of radius 1/2 can accommodate any plane curve...
Click to read more »Helly's theorem is a basic result in discrete geometry on the intersection of convex sets. It was discovered by Eduard Helly in 1913, but not published by him...
Click to read more »and perimeter 2πw. The Minkowski sum acts linearly on the perimeters of convex bodies, so the perimeter of K must be half the perimeter of this disk, which...
Click to read more »of two curves that, as a result of a point of inflection from concave to convex or vice versa, have ends of the overall curve that point in opposite directions...
Click to read more »dimensions, the 3-3 duoprism or triangular duoprism is a four-dimensional convex polytope. The duoprism is a 4-polytope that can be constructed using Cartesian...
Click to read more »(or nonahedron) is a polyhedron with nine faces. There are 2606 types of convex enneahedra, each having a different pattern of vertex, edge, and face connections...
Click to read more »\sum _{S}\alpha _{S}=1,\alpha _{S}\geq 0\right)} . The convex closure of any set function is convex over [ 0 , 1 ] n {\displaystyle [0,1]^{n}} . Consider...
Click to read more »Biconvex optimization is a generalization of convex optimization where the objective function and the constraint set can be biconvex. There are methods...
Click to read more »In seven-dimensional geometry, a pentic 7-cube is a convex uniform 7-polytope, related to the uniform 7-demicube. There are 8 unique forms. Small cellated...
Click to read more »orientation. Every closed strictly convex curve is the envelope of its supporting lines. The astroid forms a non-convex hedgehog, and the deltoid curve forms...
Click to read more »reflector is a combination of a primary concave mirror and a secondary convex mirror, often used in optical telescopes and radio antennas, the main characteristic...
Click to read more »\operatorname {acl} A={\overline {A}}} for every finite-dimensional convex set A. Moreover, a convex set is algebraically closed if and only if its complement is...
Click to read more »a polyhedron with six quadrilaterals (four-sided polygons). As for all convex polyhedra, the cube has Euler characteristic of 2, according to the formula...
Click to read more »functions of several complex variables. Suppose K {\displaystyle K} is a convex, compact, and symmetric subset of R n {\displaystyle \mathbb {R} ^{n}} ...
Click to read more »concept from convex analysis is a convex function from Rn to real numbers, which is defined through an inequality between its value on a convex combination...
Click to read more »sphenoid is convex, and divided by a transverse ridge, the infratemporal crest, into two portions. The superior or temporal portion, convex from above...
Click to read more »In mathematics, the Milman–Pettis theorem states that every uniformly convex Banach space is reflexive. The theorem was proved independently by D. Milman...
Click to read more »plan of an absolutely continuous probability measure is the gradient of a convex function. More precisely, if μ {\displaystyle \mu } and ν {\displaystyle...
Click to read more »{\displaystyle M} , the matroid polytope P M {\displaystyle P_{M}} is the convex hull of the indicator vectors of the bases of M {\displaystyle M} . Let...
Click to read more »used, this construction produces a non-convex polyhedron with the same combinatorial structure as the convex triakis octahedron, a Catalan solid with...
Click to read more »candidates are both optimal. If, on the other hand, we choose the strictly convex cost function proportional to the square of Euclidean distance ( c ( x ...
Click to read more »interpretations including in terms of geometry, Bayesian statistics and convex analysis. The LASSO is closely related to basis pursuit denoising. Lasso...
Click to read more »across the river toward the convex bank. As it flows along the floor of the river, it sweeps loose material toward the convex bank. This flow of the boundary...
Click to read more »object however same is possible for other types of mirror (concave and convex) but only for a specific conditions. However the focal length of a plane...
Click to read more »Unsolved problem in mathematics Can every n {\displaystyle n} -dimensional convex body be covered by 2 n {\displaystyle 2^{n}} smaller copies of itself? More...
Click to read more »the algorithmic treatment of convex polyhedra. Albeit primarily a tool to study the combinatorics and the geometry of convex polytopes and polyhedra, it...
Click to read more »In convex analysis, Danskin's theorem is a theorem which provides information about the derivatives of a function of the form f ( x ) = max z ∈ Z ϕ ( x...
Click to read more »has contributed to the fields of mathematical economics, game theory, and convex analysis. Gale graduated with a Bachelor of Arts from Swarthmore College...
Click to read more »{\boldsymbol {\psi }}.} If G ( . , s ) {\displaystyle G(.,{\boldsymbol {s}})} is convex for all s ∈ S ψ {\displaystyle {\boldsymbol {s}}\in {\boldsymbol {S}}_{\boldsymbol...
Click to read more »{\displaystyle V} . While the overall problem is non-convex, each sub-problem is typically convex and can be solved efficiently. Jain, Netrapalli and Sanghavi...
Click to read more »oracle) is a concept in the mathematical theory of convex optimization. It is a method to describe a convex set that is given as an input to an optimization...
Click to read more »Second World War. The mine's case is made of sheet steel, and has a slightly convex pressure plate on the top surface with a central fuze well. Two secondary...
Click to read more »never compact. However, a ball in a normed vector space will always be convex as a consequence of the triangle inequality. A subset of a metric space...
Click to read more »mismatch that requires correction. A good set of gauges will offer both convex and concave sections, and allow for their application in awkward locations...
Click to read more »The cap ranges from 2.5 to 7 cm (1–3 in) in diameter, and is initially convex before flattening. It has a slight boss that is mustard-, honey- or cream-yellow...
Click to read more »from a spherical to a convex shape. Smaller specimens tend to have more spherical pileus, while larger are more flattened convex shape, although both have...
Click to read more »{\displaystyle \psi } is c-convex iff ψ = φ c {\displaystyle \psi =\varphi ^{c}} for some φ {\displaystyle \varphi } . Like in the case of convex transformation,...
Click to read more »plane geometry the Estermann measure is a number defined for any bounded convex set describing how close to being centrally symmetric it is. It is the ratio...
Click to read more »regular-faced convex polyhedra, line 13. Linti (2013), p. 41. Shepherd (1954). Berman (1971), p. 336, See table IV, the Properties of regular-faced convex polyhedra...
Click to read more »locally convex topological vector spaces is a natural topological vector space structure on their tensor product. Namely, given locally convex topological...
Click to read more »edges are joined and which are separated. The edges that are cut from a convex polyhedron to form a net must form a spanning tree of the polyhedron, but...
Click to read more »Maurolico. Leonhard Euler, for whom the concept is named, introduced it for convex polyhedra more generally but failed to rigorously prove that it is an invariant...
Click to read more »vertex-transitive and constructed from uniform 4-polytope facets. The complete set of convex uniform 5-polytopes has not been determined, but many can be made as Wythoff...
Click to read more »monomials. Geometric programming is closely related to convex optimization: any GP can be made convex by means of a change of variables. GPs have numerous...
Click to read more »In seven-dimensional geometry, a hexic 7-cube is a convex uniform 7-polytope, constructed from the uniform 7-demicube. There are 16 unique forms. Small...
Click to read more »"archetypes". The archetypes are convex combinations of observations chosen so that observations can be approximated by convex combinations of the archetypes...
Click to read more »Austrian mathematician working in geometric number theory as well as in convex and discrete geometry. Gruber obtained his PhD at the University of Vienna...
Click to read more »A burning glass or burning lens is a large convex lens that can concentrate the Sun's rays onto a small area, heating up the area and thus resulting in...
Click to read more »In the geometry of convex polytopes, the Minkowski problem for polytopes concerns the specification of the shape of a polytope by the directions and measures...
Click to read more »in the center. It is initially convex, but already slightly undulatingly squashed while still young, becoming convex and depressed around the umbo, then...
Click to read more »consider convex polygons, but star polygons, like the pentagram, when considered, can also be regular. They use the same vertices as the convex forms, but...
Click to read more »sculptures of the eight winds on its frieze. A pulvinated frieze (or pulvino) is convex in section. Such friezes were typical of 17th-century Northern Mannerism...
Click to read more »Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set P {\displaystyle P} of n {\displaystyle n} points, in 2- or...
Click to read more »measure is log-concave. The restriction of the Lebesgue measure to any convex set is also log-concave. By a theorem of Borell, a probability measure on...
Click to read more »to convex functions of one variable as follows. If the graph of a convex function and a line intersect at two points, then the graph of the convex function...
Click to read more »mathematical optimization: Any function that is convex and continuous, and defined on a set that is convex and compact, attains its maximum at some extreme...
Click to read more »are only eight different convex deltahedra, one of which is the gyroelongated square bipyramid. More generally, the convex polyhedron in which all faces...
Click to read more »problem whose first formulation required minimizing a non-convex function. For this non-convex minimization problem, Lemaréchal applied the theory of Lagrangian...
Click to read more »is a mathematical theorem in the fields of mathematical statistics and convex geometry. The Gaussian correlation inequality states: Let μ {\displaystyle...
Click to read more »pale brown dapperling mushroom known from Australia. Cap: 1-2.5cm wide, convex and flattening with membranous flesh. The surface is cream or very light...
Click to read more »In five-dimensional geometry, a truncated 5-simplex is a convex uniform 5-polytope, being a truncation of the regular 5-simplex. There are unique 2 degrees...
Click to read more »portion is the larger, and is slightly concave transversely; the lateral is convex above, slightly concave below. The radial notch is a narrow, oblong, articular...
Click to read more »A scimitar (/ˈsɪmɪtər/ or /ˈsɪmɪtɑːr/) is a single-edged sword with a convex curved blade of about 75 to 90 cm (30 to 36 inches) associated with Middle...
Click to read more »The convex-vented horned toad (Xenophrys pachyproctus), also known as the Gelin spadefoot toad or Huang's spadefoot toad, is a species of frog in the family...
Click to read more »In geometry, a dodecahedral prism is a convex uniform 4-polytope. This 4-polytope has 14 polyhedral cells: 2 dodecahedra connected by 12 pentagonal prisms...
Click to read more »face. They are sometimes also considered quasiregular. There are only two convex quasiregular polyhedra: the cuboctahedron and the icosidodecahedron. Their...
Click to read more »In geometry, an octahedral prism is a convex uniform 4-polytope. This 4-polytope has 10 polyhedral cells: 2 octahedra connected by 8 triangular prisms...
Click to read more »adjustable mirror is the cheval glass, which the user can tilt. Convex mirrors Convex mirrors provide a wider field of view than flat mirrors, and are...
Click to read more »~f(a)+g(b).} This follows immediately from the definition of the convex conjugate. For a convex function f {\displaystyle f} this also follows from the Legendre...
Click to read more »tridecahedron, and there are only five known regular convex polyhedra. There are 96,262,938 topologically distinct convex tridecahedra, excluding mirror images, having...
Click to read more »general equilibrium model. It posits that under certain economic assumptions (convex preferences, perfect competition, and demand independence), there must be...
Click to read more »contingent cone, and the Clarke tangent cone. These three cones coincide for a convex set, but they can differ on more general sets. Let A {\displaystyle A} be...
Click to read more »been proposed to triangulate a polygon. It is trivial to triangulate any convex polygon in linear time into a fan triangulation, by adding diagonals from...
Click to read more »Repeatedly finding and removing a mouth from a non-convex polygon will eventually turn it into the convex hull of the initial polygon. This principle can...
Click to read more »New York metropolitan area. Half-moon cookies are slightly dome-shaped (convex), have frosting on a fluffy angel cake base, and are common in Central New...
Click to read more »mathematician who worked on convex geometry and reflection groups. He asked Shephard's problem on the volumes of projected convex bodies, posed another problem...
Click to read more »In geometry, a Hanner polytope is a convex polytope constructed recursively by Cartesian product and polar dual operations. Hanner polytopes are named...
Click to read more »The stepped lens design also causes less heat buildup than does a plano-convex lens of the same angle. Theatrical Fresnel lanterns are typically made in...
Click to read more »largest function that is convex and that equals four times the variance for pure states. That is, it equals four times the convex roof of the variance F...
Click to read more »mushroom. Cap: 0.6-1.5cm wide and up to 1cm high starting campanulate to convex and not expanding much with age. The surface is hygrophanous and brown but...
Click to read more »the primal–dual paradigm in the enhanced setting of KKT conditions and convex programs. Their algorithm is weakly-polynomial: it solves O ( ( n + m )...
Click to read more »treated here all give convex bounding volumes. If the object being bounded is known to be convex, this is not a restriction. If non-convex bounding volumes...
Click to read more »In four-dimensional geometry, a runcinated 24-cell is a convex uniform 4-polytope, being a runcination (a 3rd order truncation) of the regular 24-cell...
Click to read more »Steinitz's theorem, the skeleton of a truncated icosahedron, like that of any convex polyhedron, can be represented as a polyhedral graph, meaning a planar graph...
Click to read more »often has spots. It is about 30-10 centimeters in diameter. At first, it is convex and has an inrolled margin. Then, it flattens out and often becomes depressed...
Click to read more »component S0 captures the moving objects in the foreground. Images of a convex, Lambertian surface under varying illuminations span a low-dimensional subspace...
Click to read more »1/4 but 1/2. Since a convex curve intersects almost every line either twice or not at all, the unoriented Crofton formula for convex curves can be stated...
Click to read more »the Krein-Smulian theorem can refer to two theorems relating the closed convex hull and compactness in the weak topology. They are named after Mark Krein...
Click to read more »characterizes the multisets of polygons that can form the faces of simple convex polyhedra. It states that, for given numbers of triangles, quadrilaterals...
Click to read more »polyhedral combinatorics (the study of faces of convex polyhedra), convex geometry (the study of convex sets, in particular combinatorics of their intersections)...
Click to read more »pentagonal pyramids with equilateral triangles are used, the result is a non-convex deltahedron. Any such elevated dodecahedron has the same combinatorial structure...
Click to read more »optimization over particular geometries. We are given convex function f {\displaystyle f} to optimize over a convex set K ⊂ R n {\displaystyle K\subset \mathbb...
Click to read more »Restricting to the case of convex losses and coercive penalties Ciliberto et al. have shown that although Q is not convex jointly in C and A, a related...
Click to read more »area proof given above for the equilateral triangle generalizes to any (convex) equilateral polygon. In other words, if a polygon has all sides equal,...
Click to read more »inventor Anton Kutter) style uses a single concave primary, a convex secondary and a plano-convex lens between the secondary mirror and the focal plane, when...
Click to read more »efficiently solved by interior point methods. All linear programs and (convex) quadratic programs can be expressed as SDPs, and the sum of squares hierarchy...
Click to read more »has eight faces, twelve edges and six vertices. It is a convex polyhedron, and like any convex polyhedron, it has Euler's characteristic of 2, according...
Click to read more »Wiktionary, the free dictionary. A shield boss, or umbo (/ˈʌm.boʊ/), is a round, convex or conical piece of material at the centre of a shield. Shield bosses (or...
Click to read more »+ b) where a and b are the lengths of adjacent sides. Unlike any other convex polygon, a parallelogram cannot be inscribed in any triangle with less than...
Click to read more »five-pointed star polygon, formed from the diagonal line segments of a convex (or simple, or non-self-intersecting) regular pentagon. Drawing a circle...
Click to read more »a result in geometry named after Shizuo Kakutani. It states that every convex body in 3-dimensional space has a circumscribed cube, i.e. a cube all of...
Click to read more »operations on polygons Convex hull Hyperplane arrangement Polygon decomposition Polygon triangulation Minimal convex decomposition Minimal convex cover problem...
Click to read more »Dürer's solid, a convex polyhedron having the Dürer graph as its skeleton. Dürer's solid is one of only four well-covered simple convex polyhedra. Dürer's...
Click to read more »generalized by May to the little convex bodies operad, and "little disks" is a case of "folklore" derived from the "little convex bodies". In graph theory, rooted...
Click to read more »In geometry, the 600-cell is the convex regular 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,3,5}. It is also known...
Click to read more »it is non-convex. Self-intersecting 5-polytopes are also known as star polytopes, from analogy with the star-like shapes of the non-convex Kepler-Poinsot...
Click to read more »reflector or an ellipsoidal reflector with a lens train containing two plano-convex lenses or a single step lens. The carbon-arc source was so bright that it...
Click to read more »The pentakis snub dodecahedron is a convex polyhedron with 140 triangular faces, 210 edges, and 72 vertices. It has chiral icosahedral symmetry. It comes...
Click to read more »"A Polynomial Number of Random Points Does Not Determine the Volume of a Convex Body". Discrete & Computational Geometry. 46 (1). Springer Science and Business...
Click to read more »In mathematics, the affine plank problem is an open question in convex geometry posed by Thøger Bang in 1951 as a strengthening of Tarski's plank problem...
Click to read more »four-dimensional geometry, a runcinated 120-cell (or runcinated 600-cell) is a convex uniform 4-polytope, being a runcination (a 3rd order truncation) of the...
Click to read more »are smooth orbifolds whenever the target space is convex. A variety X {\displaystyle X} is called convex if the pullback of the tangent bundle to a stable...
Click to read more »John Loudon McAdam c. 1820, in which crushed stone is placed in shallow, convex layers and compacted thoroughly. A binding layer of stone dust (crushed...
Click to read more »they used the scutum, which was larger. Originally, it was oblong and convex, but by the first century BC, it had developed into the rectangular, semi-cylindrical...
Click to read more »functional and convex analysis, and related disciplines of mathematics, the polar set A ∘ {\displaystyle A^{\circ }} is a special convex set associated...
Click to read more »d-dimensional sphere. Some simplicial spheres arise as the boundaries of convex polytopes, however, in higher dimensions most simplicial spheres cannot...
Click to read more »In mathematics, a cyclic polytope, denoted C(n, d), is a convex polytope formed as a convex hull of n distinct points on a rational normal curve in Rd...
Click to read more »role in convex analysis. Given a convex (extended real) function, the epigraph might not be closed. But the lower semicontinuous hull of a convex function...
Click to read more »curve or convex shape can be generalized to n dimension as a supporting hyperplane. If two bounded connected planar shapes have disjoint convex hulls that...
Click to read more »mathematics, symmetric cones, sometimes called domains of positivity, are open convex self-dual cones in Euclidean space which have a transitive group of symmetries...
Click to read more »In five-dimensional geometry, a stericated 5-cube is a convex uniform 5-polytope with fourth-order truncations (sterication) of the regular 5-cube. There...
Click to read more »together at the rim, leaving the inside hollow and creating the shape of a convex lens. The top ("Ding") side has a center 'note' hammered into it and seven...
Click to read more »whorls in total. The spire whorls are small and slightly convex, while the body whorl is large, convex, and gradually narrows anteriorly. The suture is superficial...
Click to read more »Euclidean geometry, an isosceles trapezoid or isosceles trapezium is a convex quadrilateral with a line of symmetry bisecting one pair of opposite sides...
Click to read more »incorporation of convex hub 16-inch alloy wheels replacing the previous concave versions. Thus the original flat spoke "star" wheels became a convex design, in...
Click to read more »classified it as Conocybe mesospora. Cap: 0.9-2.5 cm wide and semiglobate to convex or sometimes campanulate with a slight umbo. When young the centre is rust...
Click to read more »variational analysis is the combination and extension of methods from convex optimization and the classical calculus of variations to a more general...
Click to read more »are usually constructed in ordinary Euclidean ("flat") space, like the convex uniform honeycombs. They may also be constructed in non-Euclidean spaces...
Click to read more »this information is also encoded in a convex polytope, which creates a powerful connection of the subject with convex geometry. Familiar examples of toric...
Click to read more »triacontahedron as it is the most common thirty-faced polyhedron, is a convex polyhedron with 30 rhombic faces. It has 60 edges and 32 vertices of two...
Click to read more »In four-dimensional geometry, the 24-cell is a convex regular 4-polytope, a four-dimensional analogue of a Platonic solid. It is named for the 24 octahedra...
Click to read more »vertex of the convex hull is chosen, one can then apply the formula using the previous and next vertices, even if those are not on the convex hull, as there...
Click to read more »five and may have been responsible for the first known proof that no other convex regular polyhedra exist. Euclid completely mathematically described the...
Click to read more »