convex


Also found in: Dictionary, Thesaurus, Financial, Acronyms, Encyclopedia, Wikipedia.

convex

 [kon´veks]
having a rounded, somewhat elevated surface.

con·vex

(kon'veks, kŏn-veks'),
Applied to a surface that is evenly curved outward, the segment of a sphere.
[L. convexus, vaulted, arched, convex, fr. con-veho, to bring together]

convex

/con·vex/ (kon´veks) having a rounded, somewhat elevated surface.convex´ity

convex

Etymology: L, convextus, vaulted
having a surface that curves outward. Compare concave.

con·vex

(kon-veks')
Applied to a surface that is evenly curved outward, as the segment of a sphere.
[L. convexus, vaulted, arched, convex, fr. con-veho, to bring together]

convex

a surface that curves evenly outward

convex 

Having a surface curved like the exterior of a sphere. See converging lens; convex mirror.

con·vex

(kon'veks)
Denotes surface evenly curved outward, segment of a sphere.
[L. convexus, vaulted, arched, convex, fr. con-veho, to bring together]

convex (konveks´),

adj having a surface that curves outward.

convex

having a rounded, somewhat elevated surface.

convex face
convex sole
see dropped sole.
References in periodicals archive ?
From this study we can conclude that one can gain the unique and best optimal solution by using the convex optimization approach in quadratic programming model.
n]) of absolutely convex neighborhoods of zero in (E, [[tau].
gamma]] forms a base of neighborhoods of zero for a locally convex topology [gamma] := [gamma][[tau], [[tau].
Referring to Figure 1, the best RMSE results for 1D TV denoising with convex [l.
Condat, "A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms," Journal of Optimization Theory and Applications, vol.
Let K be a nonempty bounded closed convex subset of a real reflexive Banach space E and [E.
F(d) is a convex function then H(d') is a concave function ([[partial derivative].
The inverse optimization problem corresponding to linear programming problem (1) can be turned into a class of convex programming problem similar to programming problem (3) equivalently.
In closing this sub-section it is worth noting that the rotating calipers have also be used to find minimum-area enclosing triangles [20], [21], squares [22], minimum-perimeter enclosures [23], and the densest double-lattice packing of a convex polygon [24].
Finally, in Section 5 we present several families of exponentially convex functions which fulfil the conditions of our results.
A polytope P is the convex hull of finitely many points in a Euclidean space; equivalently it is a bounded intersection of finitely many closed half-spaces.
For any integer k, k [less than or equal to] 3, determine the smallest positive integer H(k) such that any planar point set in general position that has at least H(k) points contains k points that are the vertices of a an empty convex k-gon, i.