Related papers: When is the rate function of a random vector stric…

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

This short note gives a sufficient condition for having the class of polynomials dense in the space of square integrable functions with respect to a finite measure dominated by the Lebesgue measure in the real line, here denoted by $L^2$.…

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…

We give a necessary condition on a geodesic in a Riemannian manifold that can run in some convex hypersurface. As a corollary we obtain peculiar properties that hold true for every convex set in any generic Riemannian manifold (M,g). For…

A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…

In this paper, we establish the existence of the efficient solutions for polynomial vector optimization problems on a nonempty closed constraint set without any convexity and compactness assumptions. We first introduce the relative…

The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space,…

Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the…

We give a sufficient condition for the existence of a quadratic exponential vector with test function in L2(Rd) ? L?(Rd). We prove the linear independence and totality, in the quadratic Fock space, of these vectors. Using a technique…

Let $E$ be a real vector space with dual space $E^*$ and let $C\subset E$ be a convex subset with more than one point. Let $f : C\to\mathbb{R}$ be a function satisfying a mild stability property at 'flat' points of the (relative) boundary…

We prove that certain quotients of entire functions are characteristic functions. Under some conditions, the probability measure corresponding to a characteristic function of that type has a density which can be expressed as a generalized…

A fundamental open question asking whether all real-valued strongly quasiconvex functions defined on $\mathbb R^n$ are necessarily continuous, akin to their convex counterparts, is answered in detail in this paper. Among other things, we…

In this paper we discuss on the vector valued version of Caristi's theorem. We show that the regularity of the cone is an essential condition to reach the vector valued version of Caristi's theorem in vector valued metric spaces. It is…

A sufficient condition for $\bar{\partial}$ to have closed range is given for pseudoconvex, possibly unbounded domains in $\mathbb{C}^n$.

This article handles in a short manner a few Laplace transform pairs and some extensions to the basic equations are developed. They can be applied to a wide variety of functions in order to find the Laplace transform or its inverse when…

Multivariate extreme value theory assumes a multivariate domain of attraction condition for the distribution of a random vector. This necessitates that each component satisfies a marginal domain of attraction condition. An approximation of…

We consider gradient descent with constant stepsizes and derive exact worst-case convergence rates on the minimum gradient norm of the iterates. Our analysis covers all possible stepsizes and arbitrary upper/lower bounds on the curvature of…

Let $\boldsymbol{X}$ be a $d$-dimensional random array on $[n]$ whose entries take values in a finite set $\mathcal{X}$, that is, $\boldsymbol{X}=\langle X_s:s\in \binom{[n]}{d}\rangle$ is an $\mathcal{X}$-valued stochastic process indexed…

We consider non-autonomous calculus of variations problems with a state constraint represented by a given closed set. We prove that if the interior of the Clarke tangent cone of the state constraint set is non-empty (this is the constraint…

An usual problem in statistics consists in estimating the minimizer of a convex function. When we have to deal with large samples taking values in high dimensional spaces, stochastic gradient algorithms and their averaged versions are…