Related papers: Minimax theorems for convex functions

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…

In this paper we established a new Simpson type conformable fractional integral equality for convex functions. Based on this identity, some results related to Simpson-like type inequalities are obtained. These results are then applied to…

Operator convex functions defined on the positive half-line play a prominent role in the theory of quantum information, where they are used to define quantum $f$-divergences. Such functions admit integral representations in terms of…

This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…

Let $\mathbb{H}$ be a Hilbert space, $E \subset \mathbb{H}$ be an arbitrary subset and $f: E \rightarrow \mathbb{R}, \: G: E \rightarrow \mathbb{H}$ be two functions. We give a necessary and sufficient condition on the pair $(f,G)$ for the…

In this paper, we first provide a simple variational proof of the existence of Nash equilibrium in Hilbert spaces by using optimality conditions in convex minimization and Schauder's fixed-point theorem. Then applications of convex analysis…

Here is one of the results of this paper (with the convention ${{1}\over {0}}=+\infty$): Let $X$ be a real Hilbert space and let $J:X\to {\bf R}$ be a $C^1$ functional, with compact derivative, such that $$\alpha^*:=\max\left…

A mapping M(t) is considered to obtain some preliminary results and a new trapezoidal form of Fejer inequality related to the h-convex functions. Furthermore the obtained results are applied to achieve some new inequalities in connection…

In this paper, we present a rigorous framework for rational minimax approximation of matrix-valued functions that generalizes classical scalar approximation theory. Given sampled data $\{(x_\ell, {F}(x_\ell))\}_{\ell=1}^m$ where…

In this note we show that a recent existence result on quasiequilibrium problems, which seems to improve deeply some well-known results, is not correct. We exhibit a counterexample and we furnish a generalization of a lemma about continuous…

Given a function $f$ defined on a nonempty and convex subset of the $d$-dimensional Euclidean space, we prove that if $f$ is bounded from below and it satisfies a convexity-type functional inequality with infinite convex combinations, then…

We present a minimax optimal solution to the problem of estimating a compact, convex set from finitely many noisy measurements of its support function. The solution is based on appropriate regularizations of the least squares estimator.…

The aim of this paper is to present some new Fejer-type results for convex functions. Improvements of Young's inequality (the arithmetic-geometric mean inequality) and other applications to special means are pointed as well.

We develop a technique for establishing lower bounds on the sample complexity of Least Squares (or, Empirical Risk Minimization) for large classes of functions. As an application, we settle an open problem regarding optimality of Least…

In this paper, we study the family ${\mathcal C}_{H}^0$ of sense-preserving complex-valued harmonic functions $f$ that are normalized close-to-convex functions on the open unit disk $\mathbb{D}$ with $f_{\bar{z}}(0)=0$. We derive a…

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…

In this paper, we establish some Simpson type inequalities for functions whose third derivatives in the absolute value are h-convex and (\alpha,m)-convex, respectively.

In this paper, we obtain some Simpson type inequalities for functions whose derivatives in absolute value are m- and (alpha,m)- logarithmically convex functions.

In information theory, some optimization problems result in convex optimization problems on strictly convex functionals of probability densities. In this note, we study these problems and show conditions of minimizers and the uniqueness of…

In this paper we first consider the class of minimal time functions in the general setting of locally convex topological vector (LCTV) spaces. The results obtained in this framework are based on a novel notion of closedness of target sets…