Related papers: Operator log-convex functions and operator means
Resolvent compositions were recently introduced as monotonicity-preserving operations that combine a set-valued monotone operator and a bounded linear operator. They generalize in particular the notion of a resolvent average. We analyze the…
We study the relations between some geometric properties of maximal monotone operators and generic geometric and analytical properties of the functions on the associate Fitzpatrick family of convex representations. We also investigate under…
We introduce floating bodies for convex, not necessarily bounded subsets of $\mathbb{R}^n$. This allows us to define floating functions for convex and log concave functions and log concave measures. We establish the asymptotic behavior of…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
We study multivariate entire functions and polynomials with non-negative coefficients. A class of {\bf Strongly Log-Concave} entire functions, generalizing {\it Minkowski} volume polynomials, is introduced: an entire function $f$ in $m$…
This note provides another proof for the {\em convexity} ({\em strict convexity}) of $\log \det ( I + KX^{-1} )$ over the positive definite cone for any given positive semidefinite matrix $K \succeq 0$ (positive definite matrix $K \succ 0$)…
We give some necessary and some sufficient conditions for the complete monotonicity on the negative half-line of a Mittag-Leffler function of Le Roy type. It is conjectured that the underlying positive random variable, when it exists, must…
Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also…
In this paper necessary conditions and sufficient conditions are given for a linear operator to be a positive operators of an Extended Lorentz cone. Similarities and differences with the positive operators of Lorentz cones are investigated.
In this paper we give a characterization of all order isomorphisms on some classes of convex functions. We deal with the class $Cvx(K)$ consisting of lower-semi-continuous convex functions defined on a convex set $K$, and its subclass…
In this article, we employ a standard convex argument to obtain new and refined inequalities related to the matrix mean of two accretive matrices, the numerical radius and the Tsallis relative operator entropy.
Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…
Fenchel subdifferential operators of lower semicontinuous proper convex functions on real Banach spaces are classically characterized as those operators that are maximally cyclically monotone or, equivalently, maximally monotone and…
In this article we discuss the solvability of some class of fully nonlinear equations, and equations with p-Laplacian in more general conditions by using a new approach given in [1] for studying the nonlinear continuous operator. Moreover…
We show that minimizers of convex functions subject to almost all linear perturbations are nondegenerate. An analogous result holds more generally, for lower-C^2 functions.
In this paper we prove that the vector play operator with a uniformly prox-regular characteristic set of constraints is continuous with respect to the BV-norm and to the BV-strict metric in the space of continuous functions of bounded…
We prove a condition on f \in C^2(\R+,\R) for the convexity of (f o det) on PSym(n), namely that f o det is convex on PSym(n) if and only if f"(s)+(n-1)/(ns) f'(s) >= 0 and f'(s)<= 0 \forall s \in \R+. This generalizes the observation that…
A general class of nonconvex optimization problems is considered, where the penalty is the composition of a linear operator with a nonsmooth nonconvex mapping, which is concave on the positive real line. The necessary optimality condition…
A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…
In this paper, we introduce the concept of operator geometrically convex functions for positive linear operators and prove some Hermite-Hadamard type inequalities for these functions. As applications, we obtain trace inequalities for…