نتایج جستجو برای: second dual space
تعداد نتایج: 1208302 فیلتر نتایج به سال:
Space as an essential and integral concept of architecture has always included different meanings and understandings, and this reduced its original meaning to general architectural features. In addition, because this concept was created in the modern period, architects’ general understanding of its indicators has unilaterally been led to the concepts such as void, freedom and movement. Therefor...
چکیده ندارد.
in this paper, we first discuss about canonical dual of g-frameλp = {λip ∈ b(h, hi) : i ∈ i}, where λ = {λi ∈ b(h, hi) :i ∈ i} is a g-frame for a hilbert space h and p is the orthogonalprojection from h onto a closed subspace m. next, we provethat, if λ = {λi ∈ b(h, hi) : i ∈ i} and θ = {θi ∈ b(k, hi) :i ∈ i} be respective g-frames for non zero hilbert spaces hand k, and λ and θ are unitarily e...
The title above is wrong, because the strong dual of a Banach space is too strong to assert that the natural correspondence between a space and its bidual is an isomorphism. This, from a categorical point of view, is indeed the right duality concept because it yields a self adjoint dualisation functor. However, for many applications the non–reflexiveness problem can be solved by replacing the n...
in this paper, we first introduce some function spaces, with certain locally convex topologies, closely related to the space of real-valued continuous functions on $x$, where $x$ is a $c$-distinguished topological space. then, we show that their dual spaces can be identified in a natural way with certain spaces of radon measures.
Homogeneous self-dual algorithms for stochastic semidefinite programs with finite event space has been proposed by Jin et al. in [12]. Alzalg [8], has adopted their work to derive homogeneous self-dual algorithms for stochastic second-order programs with finite event space. In this paper, we generalize these two results to derive homogeneous self-dual algorithms for stochastic programs with fin...
Bector et al., (1994) introduced the concept of univexity. Mishra (1998), Mishra and Reuda (2001) and Mishra et al., (2005) have applied and generalized these functions. Mathematical programming in complex spaces originated from Levinson’s discussion of linear problems (Levinson, 1966). Mishra and Reuda (2003) have generalized these upto first orders, second order with symmetric duality. Furthe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید