نتایج جستجو برای: leftvarphi_1 varphi_2right convex function

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

Journal: :Int. J. Math. Mathematical Sciences 2005
Tomonari Suzuki

Let C be a closed convex subset of a Banach space E. A mapping T on C is called a nonexpansive mapping if ‖Tx−Ty‖ ≤ ‖x− y‖ for all x, y ∈ C. We denote by F(T) the set of fixed points of T . Kirk [17] proved that F(T) is nonempty in the case that C is weakly compact and has normal structure. See also [2, 3, 5, 6, 11] and others. Convergence theorems to fixed points are also proved by many author...

2015
Imre Bárány Rolf Schneider

We deal with different properties of a smooth and strictly convex body that depend on the behavior of the planar sections of the body parallel to and close to a given tangent plane. The first topic is boundary points where any given convex domain in the tangent plane can be approximated by a sequence of suitably rescaled planar sections (so-called p-universal points). In the second topic, the g...

1999
YU-RU SYAU

In this paper, we give twoweak conditions for a lower semi-continuous function on the n-dimensional Euclidean space Rn to be a convex function. We also present some results for convex functions, strictly convex functions, and quasi-convex functions.

2016
Piotr Berman Meiram Murzabulatov Sofya Raskhodnikova

We consider the following basic geometric problem: Given ∈ (0, 1/2), a 2-dimensional figure that consists of a black object and a white background is -far from convex if it differs in at least an fraction of the area from every figure where the black object is convex. How many uniform and independent samples from a figure that is -far from convex are needed to detect a violation of convexity wi...

Journal: :CoRR 2011
Peng Cheng

where f(.) : Γf → R is an unknown, not necessarily smooth, multivariate and λ-strongly convex function, with Γf its convex definition domain. The algorithm is not allowed to accurately sample f(.) by any means since f(.) itself is unknown. Instead the algorithm can call stochastic oracles ω̃(.) at chosen points x̃1, . . . , x̃n, which are unbiased and independent probabilistic estimators of the fi...

2014
Ilya Molchanov

In a partially ordered semigroup with the duality (or polarity) transform, it is possible to define a generalisation of continued fractions. General sufficient conditions for convergence of continued fractions are provided. Two particular applications concern the cases of convex sets with the Minkowski addition and the polarity transform and the family of non-negative convex functions with the ...

2004
I. GINCHEV V. I. IVANOV

The present paper gives characterizations of radially u.s.c. convex and pseudoconvex functions f : X → R defined on a convex subset X of a real linear space E in terms of first and second-order upper Dini-directional derivatives. Observing that the property f radially u.s.c. does not require a topological structure of E, we draw the possibility to state our results for arbitrary real linear spa...

Journal: :J. Comb. Theory, Ser. A 2011
Bart De Bruyn

Let ∆ be a thick dual polar space and F a convex subspace of diameter at least 2 of ∆. Every hyperplane G of the subgeometry F̃ of ∆ induced on F will give rise to a hyperplane H of ∆, the so-called extension of G. We show that F and G are in some sense uniquely determined by H. We also consider the following problem: if e is a full projective embedding of ∆ and if eF is the full embedding of F̃ ...

2009
MUSTAPHA RAÏSSOULI

In this paper, we present various functional means in the sense of convex analysis. In particular, a logarithmic mean involving convex functionals, extending the scalar one, is introduced. In the quadratic case, our functional approach implies immediately that of positive operators. Some examples, illustrating theoretical results and showing the interest of our functional approach, are discussed.

2012
XAVIER CABRÉ

We consider the class of semi-stable positive solutions to semilinear equations −∆u = f(u) in a bounded domain Ω ⊂ Rn of double revolution, that is, a domain invariant under rotations of the first m variables and of the last n−m variables. We assume 2 ≤ m ≤ n− 2. When the domain is convex, we establish a priori Lp and H1 0 bounds for each dimension n, with p = ∞ when n ≤ 7. These estimates lead...

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

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