Related papers: Linear Functions to the Extended Reals
Function (linear) spaces on which an arbitrary function operates (i.e. the space is stable w.r.t. the pointwise unary operation defined by the function) were investigated, for continuous real or complex operations, by deLeeuw-Katznelson,…
Non-archimedean fields with restricted analytic functions may not support a full exponential function, but they always have partial exponentials defined in convex subrings. On face of this, we study the first order theory of the class of…
This paper studies the convexity properties of nonsmooth extended-real-valued weakly convex functions, a class of functions that is central to modern optimization and its applications. We establish new characterizations of convexity using…
Consider the self-map F of the space of real-valued test functions on the line which takes a test function f to the test function sending a real number x to f(f(x))-f(0). We show that F is discontinuous, although its restriction to the…
The linear continuity of a function defined on a vector space means that its restriction on every affine line is continuous. For functions defined on $\mathbb R^m$ this notion is near to the separate continuity for which it is required only…
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
By universal formulas we understand parameterized analytic expressions that have a fixed complexity, but nevertheless can approximate any continuous function on a compact set. There exist various examples of such formulas, including some in…
We generalize the classical Bernstein theorem concerning the constructive description of classes of functions uniformly continuous on the real line. The approximation of continuous bounded functions by entire functions of exponential type…
We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…
There are presented certain results on extending continuous linear operators defined on spaces of E-valued continuous functions (defined on a compact Hausdorff space X) to linear operators defined on spaces of E-valued measurable functions…
Multivariable, real-valued functions induce matrix-valued functions defined on the space of d-tuples of n-times-n pairwise-commuting self-adjoint matrices. We examine the geometry of this space of matrices and conclude that the best notion…
In the desire to quantify the success of neural networks in deep learning and other applications, there is a great interest in understanding which functions are efficiently approximated by the outputs of neural networks. By now, there…
We investigate metric projections and distance functions referring to convex bodies in finite-dimensional normed spaces. For this purpose we identify the vector space with its dual space by using, instead of the usual identification via the…
It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis…
In an unbounded plane, straight lines are used extensively for mathematical analysis. They are tools of convenience. However, those with high slope values become unbounded at a faster rate than the independent variable. So, straight lines,…
We formulate a multi-valued version of the Tietze-Urysohn extension theorem. Precisely, we prove that any upper semicontinuous multi-valued map with nonempty closed convex values defined on a closed subset (resp. closed perfectly normal…
We study some properties convex functions fulfill. Among the conclusions we obtain from such result, we are able to prove some nontrivial inequalities among real numbers, and we give an improvement of the reverse triangle inequality in the…
We apply upper and lower compensated convex transforms, which are `tight' one-sided approximations of a given function, to the extraction of fine geometric singularities from semiconvex/semiconcave functions and DC-functions in…
In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…
The minimax theory for estimating linear functionals is extended to the case of a finite union of convex parameter spaces. Upper and lower bounds for the minimax risk can still be described in terms of a modulus of continuity. However in…