Related papers: A lethargy result for real analytic functions

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

We consider the behaviour of holomorphic functions on a bounded open subset of the plane, satisfying a Lipschitz condition with exponent $\alpha$, with $0<\alpha<1$, in the vicinity of an exceptional boundary point where all such functions…

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…

Many statistical models have likelihoods which are intractable: it is impossible or too expensive to compute the likelihood exactly. In such settings, a common approach is to replace the likelihood with an approximation, and proceed with…

We consider the Gaussian approximation for functionals of a Poisson process that are expressible as sums of region-stabilizing (determined by the points of the process within some specified regions) score functions and provide a bound on…

For a $\mathcal{C}^2$-smooth function on a finite-dimensional space, a necessary condition for its quasiconvexity is the positive semidefiniteness of its Hessian matrix on the subspace orthogonal to its gradient, whereas a sufficient…

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

The generalized smooth condition, $(L_{0},L_{1})$-smoothness, has triggered people's interest since it is more realistic in many optimization problems shown by both empirical and theoretical evidence. Two recent works established the…

This is a continuation of our earlier paper \cite{PT3}. We consider here operator-valued functions (or infinite matrix functions) on the unit circle $\T$ and study the problem of approximation by bounded analytic operator functions. We…

Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…

We show that a continuous function on the analytification of a smooth proper algebraic curve over a non-archimedean field is subharmonic in the sense of Thuillier if and only if it is psh, i.e. subharmonic in the sense of Chambert-Loir and…

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…

In this paper we introduce two conceptual algorithms for minimising abstract convex functions. Both algorithms rely on solving a proximal-type subproblem with an abstract Bregman distance based proximal term. We prove their convergence when…

The arrival of AI techniques in computations, with the potential for hallucinations and non-robustness, has made trustworthiness of algorithms a focal point. However, trustworthiness of the many classical approaches are not well understood.…

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

In terms of the best approximations of functions and generalized moduli of smoothness, direct and inverse approximation theorems are proved for Besicovitch almost periodic functions whose Fourier exponent sequences have a single limit point…

The focus of this article is the approximation of functions which are analytic on a compact interval except at the endpoints. Typical numerical methods for approximating such functions depend upon the use of particular conformal maps from…

We prove that every continuous function on a separable infinite-dimensional Hilbert space X can be uniformly approximated by smooth functions with no critical points. This kind of result can be regarded as a sort of very strong approximate…

We give a new proof of a classical theorem on approximation of continuous functions on totally real sets

For a compact subset $K$ of the complex plane $\mathbb C,$ let $C(K)$ denote the algebra of continuous functions on $K$. For an open subset $U \subset K,$ let $A(K,U) \subset C(K)$ be the algebra of functions that are analytic in $U.$ We…