English
Related papers

Related papers: Some Minimax Results on Dense Sets and Dense Famil…

200 papers

In this short paper, we consider the functional density on sets of uniformly bounded triangulations with fixed sets of vertices. We prove that if a functional attains its minimum on the Delaunay triangulation, for every finite set in the…

Metric Geometry · Mathematics 2015-06-11 Nikolay P. Dolbilin , Herbert Edelsbrunner , Oleg R. Musin

We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.

Metric Geometry · Mathematics 2014-11-11 Nikolay P. Dolbilin , Herbert Edelsbrunner , Alexey Glazyrin , Oleg R. Musin

In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some…

Combinatorics · Mathematics 2024-02-05 Vladimir Gurvich , Mariya Naumova

We provide a development that unifies, simplifies and extends considerably a number of minimax results in the restricted parameter space literature. Various applications follow, such as that of estimating location or scale parameters under…

Statistics Theory · Mathematics 2012-05-10 Éric Marchand , William E. Strawderman

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…

Optimization and Control · Mathematics 2017-03-21 Miel Sharf , Daniel Zelazo

If $f$ is a real valued weakly lower semi-continous function on a Banach space $X$ and $C$ a weakly compact subset of $X$, we show that the set of $x \in X$ such that $z \mapsto \|x-z\|-f(z)$ attains its supremum on $C$ is dense in $X$. We…

Functional Analysis · Mathematics 2012-04-11 Jean-Matthieu Augé

The aim of this article is to establish new two-functions minimax inequalities extending classical results such as Simons' minimax theorem. Our results will be proved in a non-compact setting. We also prove, under general conditions, that…

Functional Analysis · Mathematics 2024-11-18 Mohammed Bachir

We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…

Functional Analysis · Mathematics 2013-07-01 Roman Drnovšek , Heydar Radjavi

Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…

General Topology · Mathematics 2015-11-25 Raúl Fierro

We study test sets: subfamilies of sequences converging to a point P that still suffice to detect every discontinuity of real-valued functions at P. Ordered by inclusion, these test sets form a poset. Under natural hypotheses at P, we prove…

Combinatorics · Mathematics 2026-05-13 Gyuhyun Lim

In this paper we prove generic results concerning Hardy spaces in one or several complex variables. More precisely, we show that the generic function in certain Hardy type spaces is totally unbounded and hence non-extentable, despite the…

Complex Variables · Mathematics 2019-05-14 Kyranna Kioulafa

Theorem 1 of [14], a minimax result for functions $f:X\times Y\to {\bf R}$, where $Y$ is a real interval, was partially extended to the case where $Y$ is a convex set in a Hausdorff topological vector space ([15], Theorem 3.2). In doing…

Functional Analysis · Mathematics 2017-01-13 Biagio Ricceri

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

Functional Analysis · Mathematics 2021-04-13 Biagio Ricceri

Let S be a dense sub-semigroup of the positive real numbers, and let X be a separable, reflexive Banach space. This note contains a proof that every weakly continuous contractive semigroup of operators on X over S can be extended to a…

Functional Analysis · Mathematics 2009-03-21 Eliahu Levy , Orr Shalit

In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively. In particular we generalize the known…

Discrete Mathematics · Computer Science 2013-09-24 Anna Huber , Vladimir Kolmogorov

This paper studies loss functions for finite sets. For a given finite set $S$, we give sum-of-square type loss functions of minimum degree. When $S$ is the vertex set of a standard simplex, we show such loss functions have no spurious…

Optimization and Control · Mathematics 2022-10-12 Jiawang Nie , Suhan Zhong

We provide finite-sample analysis of a general framework for using k-nearest neighbor statistics to estimate functionals of a nonparametric continuous probability density, including entropies and divergences. Rather than plugging a…

Statistics Theory · Mathematics 2016-08-23 Shashank Singh , Barnabás Póczos

An upper mean here is a subadditive functional $\overline M$ defined on bounded functions on a commutative group which has, beside some natural requirements, the property we call restricted additivity: if $g(x)= f(x)+f(x+t)$, then…

Classical Analysis and ODEs · Mathematics 2025-11-25 Szil\' ard Gy. R\' ev\' esz , Imre Z. Ruzsa

We study point-separating function sets that are minimal with respect to the property of being separating. We first show that for a compact space $X$ having a minimal separating function set in $C_p(X)$ is equivalent to having a minimal…

General Topology · Mathematics 2018-09-17 Raushan Buzyakova , Oleg Okunev

Integrating functions on discrete domains into neural networks is key to developing their capability to reason about discrete objects. But, discrete domains are (1) not naturally amenable to gradient-based optimization, and (2) incompatible…

Machine Learning · Computer Science 2022-11-15 Nikolaos Karalias , Joshua Robinson , Andreas Loukas , Stefanie Jegelka
‹ Prev 1 2 3 10 Next ›