30 resultados para K-uniformly Convex Functions
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
2000 Mathematics Subject Classification: Primary 30C45, 26A33; Secondary 33C15
Resumo:
In this paper an alternative characterization of the class of functions called k -uniformly convex is found. Various relations concerning connections with other classes of univalent functions are given. Moreover a new class of univalent functions, analogous to the ’Mocanu class’ of functions, is introduced. Some results concerning this class are derived.
Resumo:
∗Participant in Workshop in Linear Analysis and Probability, Texas A & M University, College Station, Texas, 2000. Research partially supported by the Edmund Landau Center for Research in Mathematical Analysis and related areas, sponsored by Minerva Foundation (Germany).
Resumo:
We give a new construction of uniformly convex norms with a power type modulus on super-reflexive spaces based on the notion of dentability index. Furthermore, we prove that if the Szlenk index of a Banach space is less than or equal to ω (first infinite ordinal) then there is an equivalent weak* lower semicontinuous positively homogeneous functional on X* satisfying the uniform Kadec-Klee Property for the weak*-topology (UKK*). Then we solve the UKK or UKK* renorming problems for Lp(X) spaces and C(K) spaces for K scattered compact space.
Resumo:
∗ The work is partially supported by NSFR Grant No MM 409/94.
Resumo:
MSC2010: 30C45, 33C45
Resumo:
2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35
Resumo:
* This work was supported by the CNR while the author was visiting the University of Milan.
Resumo:
We consider the problem of minimizing the max of two convex functions from both approximation and sensitivity point of view.This lead up to study the epiconvergence of a sequence of level sums of convex functions and the related dual problems.
Resumo:
Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. We have provided several characterizations of the larger class of closed convex sets, Motzkin decomposable, in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed. Another result establishes that a closed convex set is Motzkin decomposable if and only if the set of extreme points of its intersection with the linear subspace orthogonal to its lineality is bounded. We characterize the class of the extended functions whose epigraphs are Motzkin decomposable sets showing, in particular, that these functions attain their global minima when they are bounded from below. Calculus of Motzkin decomposable sets and functions is provided.
Resumo:
2000 Mathematics Subject Classification: 90C48, 49N15, 90C25
Resumo:
2000 Mathematics Subject Classification: 49J52, 49J50, 58C20, 26B09.
Resumo:
If ξ is a countable ordinal and (fk) a sequence of real-valued functions we define the repeated averages of order ξ of (fk). By using a partition theorem of Nash-Williams for families of finite subsets of positive integers it is proved that if ξ is a countable ordinal then every sequence (fk) of real-valued functions has a subsequence (f'k) such that either every sequence of repeated averages of order ξ of (f'k) converges uniformly to zero or no sequence of repeated averages of order ξ of (f'k) converges uniformly to zero. By the aid of this result we obtain some results stronger than Mazur’s theorem.
Resumo:
*Supported by the Grants AV ˇCR 101-97-02, 101-90-03, GA ˇCR 201-98-1449, and by the Grant of the Faculty of Civil Engineering of the Czech Technical University No. 2003.
Resumo:
MSC 2010: 30C45, 30C55