Some Bonnesen-style inequalities for higher dimensions

We discuss the higher dimensional Bonnesen-style inequalities.Though there are many Bonnesen-style inequalities for domains in the Euclidean plane R2 few results for general domain in R n(n ≥ 3) are known.The results obtained in this paper are for general domains,convex or non-convex,in Rn.     

Some quantum estimates of Hermite-Hadamard inequalities for convex functions

In this study, based on a new quantum integral identity, we establish some quantum estimates of Hermite-Hadamard type inequalities for convex functions. These results generalize and improve some known results given in literatures.     

Approximate methods for convex minimization problems with series–parallel structure

Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The problem has a series–parallel structure, with the variables divided serially into n disjoint subsets, whose elements are considered in parallel. This special structure is exploited in two algorithms proposed here for the approximate solution of the problem. The first algorithm solves at most min{m, ν − n + 1} subproblems; each subproblem has exactly one equality constraint and at most n variables. The second algorithm solves a dynamically generated sequence of subproblems; each subproblem has at most ν − n + 1 equality constraints, where ν is the total number of variables. To solve these subproblems both algorithms use the authors’ Projected Newton Bracketing method for linearly constrained convex minimization, in conjunction with the steepest descent method. We report the results of numerical experiments for both algorithms.     

Some inequalities for differentiable convex mapping with application to weighted trapezoidal formula and higher moments of random variables

Several inequalities for differentiable convex, wright-convex and quasi-convex mapping are obtained respectively that are connected with the celebrated Hermite-Hadamard integral inequality. Also, some error estimates for weighted Trapezoid formula and higher moments of random variables are given.     

A general multidimensional Hermite-Hadamard type inequality

Using a stochastic approach, we establish a multidimensional version of the classical Hermite-Hadamard inequalities which holds for convex functions on general convex bodies. The result is closely related to the Dirichlet problem.     

Projection onto polyhedra in outer representation

The projection of the origin onto an n-dimensional polyhedron defined by a system of m inequalities is reduced to a sequence of projection problems onto a one-parameter family of shifts of a polyhedron with at most m + 1 vertices in n + 1 dimensions. The problem under study is transformed into the projection onto a convex polyhedral cone with m extreme rays, which considerably simplifies the solution to an equivalent problem and reduces it to a single projection operation. Numerical results obtained for random polyhedra of high dimensions are presented.     

Refining the Hermite-Hadamard inequalities for operator convex maps in multiple operator variables

Intensive studies aiming to extend the Hermite-Hadamard inequalities and to explore some properties and applications of these inequalities have been carried out recently. The contribution of this paper falls within this framework. We investigate here some refinements of the Hermite-Hadamard inequalities for operator convex maps involving multiple operator arguments.

     

Fejer and Hermite-Hadamard type inequalities for superquadratic functions

In this paper we use basic properties of superquadratic functions to obtain new inequalities including Fejer's type and Hermite-Hadamard type inequalities. For superquadratic functions which are also convex, we get refinements of known results.     

Several Hermite-Hadamard Typ e Inequalities for Harmonically Convex Functions in the Second Sense with Applications

In this paper, we first introduce the concept“harmonically convex func-tions”in the second sense and establish several Hermite-Hadamard type inequalities for harmonically convex functions in the second sense. Finally, some applications to special mean are shown.     

Convexity results and sharp error estimates in approximate multivariate integration

An interesting property of the midpoint rule and the trapezoidal rule, which is expressed by the so-called Hermite-Hadamard inequalities, is that they provide one-sided approximations to the integral of a convex function. We establish multivariate analogues of the Hermite-Hadamard inequalities and obtain access to multivariate integration formulae via convexity, in analogy to the univariate case. In particular, for simplices of arbitrary dimension, we present two families of integration formulae which both contain a multivariate analogue of the midpoint rule and the trapezoidal rule as boundary cases. The first family also includes a multivariate analogue of a Maclaurin formula and of the two-point Gaussian quadrature formula; the second family includes a multivariate analogue of a formula by P.C. Hammer and of Simpson's rule. In both families, we trace out those formulae which satisfy a Hermite-Hadamard inequality. As an immediate consequence of the latter, we obtain sharp error estimates for twice continuously differentiable functions.

     

New inequalities of Hermite-Hadamard type via s-convex functions in the second sense with applications

In this paper, we establish some new inequalities of Hermite-Hadamard type whose derivatives in absolute value are s-convex in the second sense. Finally some applications to special means of positive real numbers are given.     

The convex hull of degree sequences of signed graphs

As shown in [D. Hoffman, H. Jordon, Signed graph factors and degree sequences, J. Graph Theory 52 (2006) 27-36], the degree sequences of signed graphs can be characterized by a system of linear inequalities. The set of all n-tuples satisfying this system of linear inequalities is a polytope P_n. In this paper, we show that P_n is the convex hull of the set of degree sequences of signed graphs of order n. We also determine many properties of P_n, including a characterization of its vertices. The convex hull of imbalance sequences of digraphs is also investigated using the characterization given in [D. Mubayi, T.G. Will, D.B. West, Realizing degree imbalances of directed graphs, Discrete Math. 239 (2001) 147-153].     

On formulations of the stochastic uncapacitated lot-sizing problem

We consider two formulations of a stochastic uncapacitated lot-sizing problem. We show that by adding (?,S) inequalities to the one with the smaller number of variables, both formulations give the same LP bound. Then we show that for two-period problems, adding another class of inequalities gives the convex hull of integral solutions.     

Jensen's inequality for spectral order and submajorization

Let A be a C^∗-algebra and be a positive unital map. Then, for a convex function defined on some open interval and a self-adjoint element a∈A whose spectrum lies in I, we obtain a Jensen's-type inequality f(?(a))??(f(a)) where ? denotes an operator preorder (usual order, spectral preorder, majorization) and depends on the class of convex functions considered, i.e., monotone convex or arbitrary convex functions. Some extensions of Jensen's-type inequalities to the multi-variable case are considered.     

Polyhedral studies on the convex recoloring problem

A coloring of the vertices of a graph G is convex if, for each assigned color d, the vertices with color d induce a connected subgraph of G. We address the convex recoloring problem, defined as follows. Given a graph G and a coloring of its vertices, recolor a minimum number of vertices of G, so that the resulting coloring is convex. This problem is known to be NP-hard even when G is a path. We show an integer programming formulation for the weighted version of this problem on arbitrary graphs, and then specialize it for trees. We study the facial structure of the polytope defined as the convex hull of the integer points satisfying the restrictions of the proposed ILP formulation, present several classes of facet-defining inequalities and discuss separation algorithms.     

Hyperplane sections of convex bodies

We prove sharp inequalities for the volumes of hyperplane sections bisecting a convex body in Rn. This leads to a relative isoperimetric inequality for arbitrary hyperplane sections of a convex body.     

Inequalities for integral means over symmetric sets

We prove that the integral of n functions over a symmetric set L in Rn, with additional properties, increases when the functions are replaced by their symmetric decreasing rearrangements. The result is known when L is a centrally symmetric convex set, and our result extends it to nonconvex sets. We deduce as consequences, inequalities for the average of a function whose level sets are of the same type as L, over measurable sets in Rn. The average of such a function on E is maximized by the average over the symmetric set E^*.     

Inequalities on the Triangle

The article deals with generalizations of the inequalities for convex functions on the triangle. The Jensen and the Hermite-Hadamard inequality are included in the study. Considering a convex function on the triangle, we obtain a generalization of the Jensen-Mercer inequality, and a refinement of the Hermite-Hadamard inequality.     

On the variance of random polytopes

A random polytope is the convex hull of uniformly distributed random points in a convex body K. A general lower bound on the variance of the volume and f-vector of random polytopes is proved. Also an upper bound in the case when K is a polytope is given. For polytopes, as for smooth convex bodies, the upper and lower bounds are of the same order of magnitude. The results imply a law of large numbers for the volume and f-vector of random polytopes when K is a polytope.     

On weighted Hermite-Hadamard inequalities

In this paper, we give a weighted form of the Hermite-Hadamard inequalities. Some applications of them are also derived. The results presented here would provide extensions of those given in earlier works. Finally we pose two interesting problems.