نتایج جستجو برای: being convex
تعداد نتایج: 641293 فیلتر نتایج به سال:
We prove that for any collection F of n ≥ 2 pairwise disjoint compact convex sets in the plane there is a pair A and B such line separates from either or subcollection with at least /18 sets.
The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. In this paper we propose an iterative algorithm for finding the common element of the minimizers of a finite family of convex functions a...
In this manuscript, a new class of extended (m1,m2)-convex and concave functions is introduced. After some properties of (m1,m2)-convex functions have been given, the inequalities obtained with Hölder and Hölder-İşcan and power-mean and improwed power-mean integral inequalities have been compared and it has been shown that the inequality with Hölder-İşcan inequality gives a better approach than...
In this paper, we define the almost uniform convergence and the almost everywhere convergence for cone-valued functions with respect to an operator valued measure. We prove the Egoroff theorem for Pvalued functions and operator valued measure θ : R → L(P, Q), where R is a σ-ring of subsets of X≠ ∅, (P, V) is a quasi-full locally convex cone and (Q, W) is a locally ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید