Related papers: Characterization of polyconvex isotropic functions
A double-well energy expressed as a minimum of two quadratic functions, called phase energies, is studied with taking into account the minimization of the corresponding integral functional. Such integral, as being not sequentially weakly…
A weak-strong uniqueness result is proved for measure-valued solutions to the system of conservation laws arising in elastodynamics. The main novelty brought forward by the present work is that the underlying stored-energy function of the…
Convexity is an important notion in non linear optimization theory as well as in infinite dimensional functional analysis. As will be seen below, very simple and powerful tools will be derived from elementary duality arguments (which are…
We show that, in toric manifolds, one can characterize the sign of the Ricci curvature in terms of the convexity of the volume functional. More generally we discuss relationships between (i) Ricci curvature and volume, (ii) totally real and…
In this paper some concepts of convex analysis on hyperbolic space are studied. We first study properties of the intrinsic distance, for instance, we present the spectral decomposition of its Hessian. Next, we study the concept of convex…
We introduce a condition on accretive matrix functions, called $p$-ellipticity, and discuss its applications to the $L^p$ theory of elliptic PDE with complex coefficients. Our examples are: (i) generalized convexity of power functions…
Pseudoconvexity of a domain in $\Bbb C^n$ is described in terms of the existence of a locally defined plurisubharmonic/holomorphic function near any boundary point that is unbounded at the point.
We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
We investigate metric projections and distance functions referring to convex bodies in finite-dimensional normed spaces. For this purpose we identify the vector space with its dual space by using, instead of the usual identification via the…
In this paper, a new class of convex functions as a generalization of convexity which is called (h-m)-convex functions and some properties of this class is given. We also prove some Hadamard's type inequalities.
We define a class of divergences to measure differences between probability density functions in one-dimensional sample space. The construction is based on the convex function with the Jacobi operator of mapping function that pushforwards…
We define a multidimensional rearrangement, which is related to classical inequalities for functions that are monotone in each variable. We prove the main measure theoretical results of the new theory and characterize the functional…
We present a generalization of the notion of neighborliness to non-polyhedral convex cones. Although a definition of neighborliness is available in the non-polyhedral case in the literature, it is fairly restrictive as it requires all the…
The convolution of a function with an isotropic Gaussian appears in many contexts such as differential equations, computer vision, signal processing, and numerical optimization. Although this convolution does not always have a closed form…
We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…
The dominant method for defining multivariate operator means is to express them as fix-points under a contraction with respect to the Thompson metric. Although this method is powerful, it crucially depends on monotonicity. We are developing…
We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization…
We will use different way (in this work) from the existing methods in the literature which speaking in the separation of convex sets was carried out by hyperplanes. We are examining the behavior of convex set which is the domain of convex…
The matrix convexity and the matrix monotony of a real $C^1$ function $f$ on $(0,\infty)$ are characterized in terms of the conditional negative or positive definiteness of the Loewner matrices associated with $f$, $tf(t)$, and $t^2f(t)$.…