نتایج جستجو برای: convex uncertainty set
تعداد نتایج: 807543 فیلتر نتایج به سال:
let $x$ be a real normed space, then $c(subseteq x)$ is functionally convex (briefly, $f$-convex), if $t(c)subseteq bbb r $ is convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$ is functionally closed (briefly, $f$-closed), if $t(k)subseteq bbb r $ is closed for all bounded linear transformations $tin b(x,r)$. we improve the krein-milman theorem ...
R d with a Lévy density given by c|x| 1{|x|<1} for some constant c. In this paper we study the potential theory of truncated symmetric stable processes in detail. We prove a Harnack inequality for nonnegative harmonic nonnegative functions these processes. We also establish a boundary Harnack principle for nonnegative functions which are harmonic with respect to these processes in bounded conve...
R d with a Lévy density given by c|x| 1{|x|<1} for some constant c. In this paper we study the potential theory of truncated symmetric stable processes in detail. We prove a Harnack inequality for nonnegative harmonic nonnegative functions of these processes. We also establish a boundary Harnack principle for nonnegative functions which are harmonic with respect to these processes in bounded co...
Z. Takáč in [16] introduced the aggregation operators on any subalgebra of M (set of all fuzzy membership degrees of the type-2 fuzzy sets, that is, the functions from [0,1] to [0,1]). Furthermore, he applied the Zadeh’s extension principle (see [24]) to obtain in [16, 17] a set of aggregation operators on L* (the strongly normal and convex functions of M). In this paper, we introduce the aggre...
R d with a Lévy density given by c|x| 1{|x|<1} for some constant c. In this paper we study the potential theory of truncated symmetric stable processes in detail. We prove a Harnack inequality for nonnegative harmonic nonnegative functions of these processes. We also establish a boundary Harnack principle for nonnegative functions which are harmonic with respect to these processes in bounded co...
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
The property that an optimal solution to the problem of minimizing a continuous concave function over a compact convex set in IRn is attained at an extreme point is generalized by the Bauer Minimum Principle to the infinite dimensional context. The problem of approximating and characterizing infinite dimensional extreme points thus becomes an important problem. Consider now an infinite dimensio...
Any non-empty open convex subset of Rn is the convex hull of a complete submanifold M , of any codimension, but there are obstructions if the geometry of M is, a priori, suitably controlled at infinity. In this paper we develop tools to explore the geometry of ∂[Conv(M)] when the Grassmanian-valued Gauss map of M is uniformly continuous, a condition that, in the C2 case, is weaker than bounding...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید