Related papers: Characterizations of Pseudoconvex Functions

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

We view a conic optimization problem that has a unique solution as a map from its data to its solution. If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized…

In this article, we further explore convex functions by revealing new bounds, resulting from stronger convexity behavior. In particular, we define the so called radical convex functions and study their properties. We will see that such…

For any scalar-valued bivariate function that is locally Lipschitz continuous and directionally differentiable, it is shown that a subgradient may always be constructed from the function's directional derivatives in the four compass…

In recent work by Zimmer it was proved that if $\Omega\subset\mathbb C^n$ is a bounded convex domain with $C^\infty$-smooth boundary, then $\Omega$ is strictly pseudoconvex provided that the squeezing function approaches one as one…

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…

An invex function generalizes a convex function in the sense that every stationary point is a global minimizer. Recently, invex functions and their subclasses have attracted attention in signal processing and machine learning. However,…

A function in a class $\mathcal{F}(X)$ is said to be subdifferentially determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any function in $\mathcal{F}(X)$ with the same subdifferential. A function is said to be…

This paper presents necessary, sufficient, and equivalent conditions for the spherical convexity of non-homogeneous quadratic functions. In addition to motivating this study and identifying useful criteria for determining whether such…

We construct a strictly pseudoconvex domain with smooth boundary whose squeezing function is not plurisubharmonic.

If $X$ is a convex surface in a Euclidean space, then the squared intrinsic distance function $\dist^2(x,y)$ is DC (d.c., delta-convex) on $X\times X$ in the only natural extrinsic sense. An analogous result holds for the squared distance…

We prove that an open set $D$ in $\C^n$ is pseudoconvex if and only if for any $z\in D$ the largest balanced domain centered at $z$ and contained in $D$ is pseudoconvex, and consider analogues of that characterization in the linearly convex…

Results on the upper and lower semicontinuity of functionals defined on spaces of convex and more general functions are established. In particular, the following result is obtained. Let $\phi(v; \cdot)$ be the density of the absolutely…

A function $f:\ \{-1,1\}^n\rightarrow \mathbb{R}$ is called pseudo-Boolean. It is well-known that each pseudo-Boolean function $f$ can be written as $f(x)=\sum_{I\in {\cal F}}\hat{f}(I)\chi_I(x),$ where ${\cal F}\subseteq \{I:\ I\subseteq…

We give a necessary and sufficient condition for a difference of convex (DC, for short) functions, defined on a locally convex space, to be Lipschitz continuous. Our criterion relies on the intersections of the "epsilon-subdifferentials of…

Let $I\subseteq{\mathbb{R_+}}$ be a non empty and non singleton interval where ${\mathbb{R_+}}$ denotes the set of all non negative numbers. A function $\Phi: I\to {\mathbb{R_+}}$ is said to be subadditive if for any $x,y$ and $x+y\in I$,…

We extend deconvolution in a periodic setting to deal with functional data. The resulting functional deconvolution model can be viewed as a generalization of a multitude of inverse problems in mathematical physics where one needs to recover…

We discuss the following question: For a function f of two or more variables which is convex in the directions of coordinate axes, how can its trace g(x) = f(x, x, ..., x) look like? In the two-dimensional case, we provide some necessary…

This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…

We observe that if f is a continuous function on an interval I and x_0 \in I, then f is operator monotone if and only if the function (f(x) - f(x_0)/(x - x_0) is strongly operator convex. Then starting with an operator monotone function…