Refined convex Sobolev inequalities

This paper is devoted to refinements of convex Sobolev inequalities in the case of power law relative entropies: a nonlinear entropy-entropy production relation improves the known inequalities of this type. The corresponding generalized Poincaré-type inequalities with weights are derived. Optimal constants are compared to the usual Poincaré constant.     

A numerical investigation of HELP inequalities

Recent work on the Hardy Everitt Littlewood and Pölya (HELP) inequality using numerical techniques is presented and analysed further. New techniques are used to integrate the highly oscillatory solutions that restricted the range of problems covered in earlier publications.     

Convex numerical radius

In this work we introduce the concept of convex numerical radius for a continuous and linear operator in a Banach space, which generalizes that of the classical numerical radius. Besides studying some of its properties, we give a version of James's sup theorem in terms of convex numerical radius attaining operators.     

Bifractional inequalities and convex cones

In this paper we give a systematic study of a class of linear inequalities related to convex cones in linear spaces. In particular, Chebyshev and Andersson type inequalities are discussed. Some classical and new inequalities are derived from the results.     

A method of local convex majorants for solving variational-like inequalities

A numerical method based on convex approximations that locally majorize a gap function is proposed for solving a variational-like inequality. The algorithm is theoretically validated and the results of comparison of its numerical efficiency to that of the conventional methods are presented.     

Numerical radius inequalities for operator matrices

We prove a numerical radius inequality for operator matrices, which improves an earlier inequality due to Hou and Du. As an application of this numerical radius inequality, we derive a new bound for the zeros of polynomials.     

Consistency of finite systems of convex inequalities

We give necessary and sufficient conditions for the existence of a convex functionu which satisfies a finite list of inequalities of the typeu(a)<u(b) oru(a)≤u(b), wherea, b are finite dimensional vectors.     

Systems of convex inequalities and their applications

In this paper, we shall prove some results related to doubly-stochastic operators and invariant measures which may be obtained from a general condition by Fan (Math. Z. 68 (1957), 205–217) for the existence of solutions of general systems of convex inequalities in topological vector spaces.     

A generalized localization theorem and geometric inequalities for convex bodies

In this article, we generalize a localization theorem of Lovász and Simonovits [Random walks in a convex body and an improved volume algorithm, Random Struct. Algorithms 4-4 (1993) 359-412] which is an important tool to prove dimension-free functional inequalities for log-concave measures. In a previous paper [Fradelizi and Guédon, The extreme points of subsets of s-concave probabilities and a geometric localization theorem, Discrete Comput. Geom. 31 (2004) 327-335], we proved that the localization may be deduced from a suitable application of Krein-Milman's theorem to a subset of log-concave probabilities satisfying one linear constraint and from the determination of the extreme points of its convex hull. Here, we generalize this result to more constraints, give some necessary conditions satisfied by such extreme points and explain how it may be understood as a generalized localization theorem. Finally, using this new localization theorem, we solve an open question on the comparison of the volume of sections of non-symmetric convex bodies in Rⁿ by hyperplanes. A surprising feature of the result is that the extremal case in this geometric inequality is reached by an unusual convex set that we manage to identify.     

Two inequalities for volumes of convex bodies

Precise upper and lower bounds are given for that portion of a convex body cut off from the latter, in n-dimensional space, by a hyperplane passing through its centroid; a bound is also given for the whole volume in terms of relative n-diameters of Bernstein type.Translated from Matematicheskie Zametki, Vol. 5, No. 1, pp. 99–106, January, 1969.     

A numerical method of nondifferentiable convex optimization with constraints

An iterative process is examined for minimizing a convex nondifferentiable functional on a convex closed set in a real Hilbert space. Convergence of the proposed process is proved. A two-sided bound on the optimal functional value is given.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 57, pp. 124–131, 1985.     

Generalized convex functions and vector variational inequalities

In this paper, (, ,Q)-invexity is introduced, where :X ×X intR _m ⁺ , :X ×X X,X is a Banach space,Q is a convex cone ofR ^m . This unifies the properties of many classes of functions, such asQ-convexity, pseudo-linearity, representation condition, null space condition, andV-invexity. A generalized vector variational inequality is considered, and its equivalence with a multi-objective programming problem is discussed using (, ,Q)-invexity. An existence theorem for the solution of a generalized vector variational inequality is proved. Some applications of (, ,Q)-invexity to multi-objective programming problems and to a special kind of generalized vector variational inequality are given.The author is indebted to Dr. V. Jeyakumar for his constant encouragement and useful discussion and to Professor P. L. Yu for encouragement and valuable comments about this paper.     

Eigenvalue inequalities for convex and log-convex functions

We give a matrix version of the scalar inequality f(a + b) ? f(a) + f(b) for positive concave functions f on [0, ∞). We show that Choi’s inequality for positive unital maps and operator convex functions remains valid for monotone convex functions at the cost of unitary congruences. Some inequalities for log-convex functions are presented and a new arithmetic-geometric mean inequality for positive matrices is given. We also point out a simple proof of the Bhatia-Kittaneh arithmetic-geometric mean inequality.     

Some integral inequalities for logarithmically convex functions

The main aim of the present note is to establish new Hadamard like integral inequalities involving log-convex function. We also prove some Hadamard-type inequalities, and applications to the special means are given.