Related papers: Covering Numbers for Convex Functions

In this paper, we focus on the problem of stochastic optimization where the objective function can be written as an expectation function over a closed convex set. We also consider multiple expectation constraints which restrict the domain…

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety…

In these notes, uniform convergence on compacta is studied on the space of functions taking values in the set of finite Borel measures. Related limit theorems, including L\'evy's continuity theorem and functional limit theorems for…

It is shown that a Banach space with locally uniformly convex dual admits an equivalent norm which is itself locally uniformly convex. It follows that on any such space all continuous real-valued functions may be uniformly approximated by…

We prove a Lusin approximation of functions of bounded variation. If $f$ is a function of bounded variation on an open set $\Omega\subset X$, where $X=(X,d,\mu)$ is a given complete doubling metric measure space supporting a $1$-Poincar\'e…

We obtain boundedness for the bilinear spherical maximal function in a range of exponents that includes the Banach triangle and a range of $L^p$ with $p<1$. We also obtain counterexamples that are asymptotically optimal with our positive…

We investigate the $L^p$ mapping properties of maximal functions associated with analytic hypersurfaces in $\mathbb R^d$, with a particular emphasis on the role of transversality. Around points that are not transversal, we show that the…

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

In this note we announce that under general hypotheses, wavelet-type expansions (of functions in $L^p,\ 1\leq p \leq \infty$, in one or more dimensions) converge pointwise almost everywhere, and identify the Lebesgue set of a function as a…

We study maximal functions related to homogeneous polynomial hypersurfaces in $\mathbb{R}^3$. In a sense made precise in this paper, the region of $(p,q)$ for which we obtain $L^p\rightarrow L^q$ boundedness is optimal up to the endpoints…

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

This paper aims to study the dual of an extended locally convex space. In particular, we study the weak and weak* topologies as well as the topology of uniform convergence on bounded subsets of an extended locally convex space. As an…

Functions, uniformly bounded in $BV$ norm in some bounded open set $U$ in $R^n$, are compact in $L_1(U)$. This result is known when $U$ has Lipschitz boundary [EG Th. 4 p. 176], [G 1.19 Th. p. 17], [Z 5.34 Cor. p. 227]; the proof for…

This paper addresses the problem of estimating a convex regression function under both the sup-norm risk and the pointwise risk using B-splines. The presence of the convex constraint complicates various issues in asymptotic analysis,…

We show that capacity can be computed with locally Lipschitz functions in locally complete and separable metric spaces. Further, we show that if $(X,d,\mu)$ is a locally complete and separable metric measure space, then continuous functions…

We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n)…

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…

In the Metric Capacitated Covering (MCC) problem, given a set of balls $\mathcal{B}$ in a metric space $P$ with metric $d$ and a capacity parameter $U$, the goal is to find a minimum sized subset $\mathcal{B}'\subseteq \mathcal{B}$ and an…