نتایج جستجو برای: C*-extreme point

تعداد نتایج: 1601712  

Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...

Journal: :bulletin of the iranian mathematical society 2012
qiuhong luo xiantao wang

the main aim of this paper is to introduce three classes $h^0_{p,q}$, $h^1_{p,q}$ and $th^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. first, we discuss the starlikeness and convexity of mappings in $h^0_{p,q}$ and $h^1_{p,q}$. then establish the covering theorem for mappings in $h^1_{p,q}$. finally, we determine the extreme points of the class $th^*_{p}$.

Journal: :bulletin of the iranian mathematical society 2015
j. qiao j. chen m. shi

inthis paper, the main aim is to introduce the class $mathcal{u}_p(lambda,alpha,beta,k_0)$ of $p$-harmonic mappings togetherwith its subclasses $mathcal{u}_p(lambda,alpha,beta,k_0)capmathcal {t}_p$ and $mathcal{u}_p(lambda,alpha,beta,k_0)capmathcal {t}_p^0$, andinvestigate the properties of the mappings in these classes. first,we give a sufficient condition for mappings to be in $mathcal{u}_p(l...

Journal: :Bulletin of the Australian Mathematical Society 1972

Let S be a semigroup. In certain cases we give some characterizations of extreme amenability of S and we show that in these cases extreme left amenability and extreme right amenability of S are equivalent. Also when S is a compact topological semigroup, we characterize extremely left amenable subalgebras of C(S), where C(S) is the space of all continuous bounded real valued functions on S

Journal: :Pacific Journal of Mathematics 1974

Journal: :European Journal of Operational Research 1998
Jennifer A. Blue Kristin P. Bennett

We develop a new hybrid tabu search method for optimizing a continuous diieren-tiable function over the extreme points of a polyhedron. The method combines extreme point tabu search with traditional descent algorithms based on linear programming. The tabu search algorithm utilizes both recency-based and frequency-based memory and oscillates between local improvement and diversiication phases. T...

Journal: :Journal of Multivariate Analysis 1983

Journal: :Proceedings of the American Mathematical Society 2000

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید