Related papers: Logarithmic Derivatives of Least Deviation from Ze…
We prove an analogue of Chebyshev's alternation theorem for linearly independent discrete functions $\Phi_n=\{\varphi_k\}_{k=1}^n$ on the interval $[0,q]_{\mathbb{Z}}=[0,q]\cap \mathbb{Z}$. In particular, we establish that the polynomial of…
We derive a sharp Logarithmic Sobolev inequality with monomial weights starting from a sharp Sobolev inequality with monomial weights. Several related inequalities such as Shannon type and Heisenberg's uncertain type are also derived. A…
We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$ with the goal to approximate a function $f\in\mathcal{C}\left[-1,1\right]$ by a polynomial of degree $n$. We investigate the…
Let $X$ be a real-valued random variable with distribution function $F$. Set $X_1,\dots, X_m$ to be independent copies of $X$ and let $F_m$ be the corresponding empirical distribution function. We show that there are absolute constants…
A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unconstrained optimization problems. For an objective function…
It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…
For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…
It is proved that one cannot approximate stably the first derivative of a smooth function given noisy values of this function and a bound on this function and its first derivative. Such an approximation is shown to be possible if an a…
An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…
We prove that the distribution density of any non-constant polynomial $f(\xi_1,\xi_2,\ldots)$ of degree $d$ in independent standard Gaussian random variables $\xi$ (possibly, in infinitely many variables) always belongs to the…
Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…
We introduce new moduli of smoothness for functions $f\in L_p[-1,1]\cap C^{r-1}(-1,1)$, $1\le p\le\infty$, $r\ge1$, that have an $(r-1)$st locally absolutely continuous derivative in $(-1,1)$, and such that $\varphi^rf^{(r)}$ is in…
We study derivative-free methods for policy optimization over the class of linear policies. We focus on characterizing the convergence rate of these methods when applied to linear-quadratic systems, and study various settings of driving…
The goal of the paper is establishing the approximation of mixed partial derivatives of the second order of a function of several variables via modified Bernstein polynomials in the $L_1$ norm under the minimal regularity.
The aim of this short note is twofold. First, we give a sketch of the proof of a recent result proved by the authors in the paper [Colombo, Crippa, and Spirito, Calc. Var. Partial Differential Equations 2015] concerning existence and…
The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…
The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…
We prove a sharp inequality for the modulus of the logarithmic derivative of a polynomial in the lemniscate components containing no critical points.
We introduce a new method that uses AAA approximation to reliably compute all the zeros of a holomorphic function in a specified search region in the complex plane. Specifically, the method is based on rational approximation of the…
In nonsmooth optimization, a negative subgradient is not necessarily a descent direction, making the design of convergent descent methods based on zeroth-order and first-order information a challenging task. The well-studied bundle methods…