English
Related papers

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

200 papers

We provide a sufficient condition for an invertible (locally strongly) convex vector-valued function on $\mathbb{R}^N$ to have a (locally strongly) convex inverse. We show under suitable conditions that if the gradient of each component of…

Classical Analysis and ODEs · Mathematics 2023-09-04 Robert Planqué

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

Classical Analysis and ODEs · Mathematics 2014-08-19 Heinz H. Bauschke , Yves Lucet , Hung M. Phan

In the present article we provide a sufficient condition for a closed set F in R^d to have the following property which we call c-removability: Whenever a function f:R^d->R is locally convex on the complement of F, it is convex on the whole…

Functional Analysis · Mathematics 2013-09-06 Dusan Pokorny , Martin Rmoutil

We show that for a convex solid set of positive random variables to be tight, or equivalently bounded in probability, it is necessary and sufficient that it is radially bounded, i.e. that every ray passing through one of its elements…

Probability · Mathematics 2017-04-04 Pablo Koch-Medina , Cosimo Munari , Mario Šikić

We give sufficient conditions for the expected excess and the upper semideviation of recourse functions to be strongly convex. This is done in the setting of two-stage stochastic programs with complete linear recourse and random right-hand…

Optimization and Control · Mathematics 2018-02-20 Matthias Claus , Rüdiger Schultz , Kai Spürkel

Under a mild technical assumption, we prove a necessary and sufficient condition for a totally real compacdt set in $\mathbb{C}^n$ to be rationally convex. This generalizes a classical result of Duval-Sibony

Complex Variables · Mathematics 2023-10-04 Blake J. Boudreaux , Rasul Shafikov

The condition number of a differentiable convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…

Optimization and Control · Mathematics 2020-04-21 David H. Gutman , Javier F. Pena

Let $D$ be a convex subset of a real vector space. It is shown that a radially lower semicontinuous function $f: D\to \mathbf{R}\cup \{+\infty\}$ is convex if and only if for all $x,y \in D$ there exists $\alpha=\alpha(x,y) \in (0,1)$ such…

Classical Analysis and ODEs · Mathematics 2017-09-26 Paolo Leonetti

The condition number of a smooth convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…

Optimization and Control · Mathematics 2018-02-02 David H. Gutman , Javier F. Pena

We obtain necessary and sufficient conditions on a function in order that it be the Laplace transform of an absolutely monotonic function. Several closely related results are also given.

Classical Analysis and ODEs · Mathematics 2016-12-08 Stamatis Koumandos , Henrik L. Pedersen

Sufficient conditions are given for a function $F(p)$, analytic in Re$p>0$, to be a Laplace transform of a function $f(t)$, such that $max_{t\ge 0}|f(t)|<\infty$, $f(0)=0$.

Classical Analysis and ODEs · Mathematics 2022-01-13 Alexander G. Ramm

In decision-making problems under uncertainty, probabilistic constraints are a valuable tool to express safety of decisions. They result from taking the probability measure of a given set of random inequalities depending on the decision…

Optimization and Control · Mathematics 2021-02-09 Yassine Laguel , Wim van Ackooij , Jérôme Malick , Guilherme Ramalho

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

We prove that if $u:\mathbb{R}^n\to\mathbb{R}$ is strongly convex, then for every $\varepsilon>0$ there is a strongly convex function $v\in C^2(\mathbb{R}^n)$ such that $|\{u\neq v\}|<\varepsilon$ and $\Vert u-v\Vert_\infty<\varepsilon$.

Classical Analysis and ODEs · Mathematics 2024-03-26 Daniel Azagra , Marjorie Drake , Piotr Hajłasz

Given a monotone convex function on the space of essentially bounded random variables with the Lebesgue property (order continuity), we consider its extension preserving the Lebesgue property to as big solid vector space of random variables…

Functional Analysis · Mathematics 2014-02-20 Keita Owari

We provide an upper bound as a random variable for the functions of estimators in high dimensions. This upper bound may help establish the rate of convergence of functions in high dimensions. The upper bound random variable may converge…

Econometrics · Economics 2020-08-07 Mehmet Caner , Xu Han

In the article the necessary and sufficient conditions for a representation of Lipschitz function of two variables as a difference of two convex functions are formulated. An algorithm of this representation is given. The outcome of this…

Optimization and Control · Mathematics 2025-02-07 Igor Proudnikov

Let us say that a convex function f\colon C\to[-\infty,\infty] on a convex set C\subseteq\R is infimum-stable if, for any sequence (f_n) of convex functions f_n\colon C\to[-\infty,\infty] converging to f pointwise, one has \inf_C…

Optimization and Control · Mathematics 2013-08-05 Iosif Pinelis

A new nonparametric estimator of a convex regression function in any dimension is proposed and its convergence properties are studied. We start by using any estimator of the regression function and we \emph{convexify} it by taking the…

Statistics Theory · Mathematics 2010-06-16 Néstor E. Aguilera , Liliana Forzani , Pedro Morin

The entropy per coordinate in a log-concave random vector of any dimension with given density at the mode is shown to have a range of just 1. Uniform distributions on convex bodies are at the lower end of this range, the distribution with…

Information Theory · Computer Science 2024-05-07 Sergey Bobkov , Mokshay Madiman
‹ Prev 1 2 3 10 Next ›