Related papers: Uniform and pointwise shape preserving approximati…

We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we…

In this paper, we study the Jacobi frame approximation with equispaced samples and derive an error estimation. We observe numerically that the approximation accuracy gradually decreases as the extended domain parameter $\gamma$ increases in…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

We present a hierarchy of semidefinite programs (SDPs) for the problem of fitting a shape-constrained (multivariate) polynomial to noisy evaluations of an unknown shape-constrained function. These shape constraints include convexity or…

Let $\alpha\in(0,1)\setminus{\Bbb Q}$ and $K=\{(e^z,e^{\alpha z}):\,|z|\leq1\}\subset{\Bbb C}^2$. If $P$ is a polynomial of degree $n$ in ${\Bbb C}^2$, normalized by $\|P\|_K=1$, we obtain sharp estimates for $\|P\|_{\Delta^2}$ in terms of…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued…

We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak…

Approximating the permanent of a complex-valued matrix is a fundamental problem with applications in Boson sampling and probabilistic inference. In this paper, we extend factor-graph-based methods for approximating the permanent of…

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

We extend to $p$-uniformly convex spaces tools from the analysis of fixed point iterations in linear spaces. This study is restricted to an appropriate generalization of single-valued, pointwise $\alpha$-averaged mappings. Our main…

We obtain matching direct and inverse theorems for the degree of weighted $L_p$-approximation by polynomials with the Jacobi weights $(1-x)^\alpha (1+x)^\beta$. Combined, the estimates yield a constructive characterization of various…

We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…

We prove explicit finite-$N$ lower bounds for $\mathbb P(\bigcup_{k=1}^N A_k)$ when the $\sigma$-algebras generated by an event sequence satisfy quantitative $\varphi$- or $\alpha$-mixing bounds. The main $\varphi$-mixing estimate is…

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…

In this paper we consider the problem of counting algebraic numbers $\alpha$ of fixed degree $n$ and bounded height $Q$ such that the derivative of the minimal polynomial $P_{\alpha}(x)$ of $\alpha$ is bounded, $|P_{\alpha}'(\alpha)| <…