Related papers: Optimal Polynomial Approximants in $L^p$
In this paper, we shall prove the $L^{p}$ endpoint decay estimates of oscillatory integral operators with homogeneous polynomial phases $S$ in $\mathbb{R} \times \mathbb{R}$. As a consequence, sharp $L^{p}$ decay estimates are also obtained…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
We consider the algorithmic problem of finding a near-optimal solution for the number partitioning problem (NPP). The NPP appears in many applications, including the design of randomized controlled trials, multiprocessor scheduling, and…
The problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, machine learning, game theory, and combinatorics, among others.…
This paper addresses the problem of solving a class of nonlinear optimal control problems (OCP) with infinite-dimensional linear state constraints involving Riesz-spectral operators. Each instance within this class has time/control…
We study the problem of {\em properly} learning large margin halfspaces in the agnostic PAC model. In more detail, we study the complexity of properly learning $d$-dimensional halfspaces on the unit ball within misclassification error…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…
Let $G$ be the interior domain of a piecewise analytic Jordan curve without cusps. Let $\{p_n\}_{n=0}^\infty$ be the sequence of polynomials that are orthonormal over $G$ with respect to the area measure, with each $p_n$ having leading…
The $\ell_p$ regularization problem with $0< p< 1$ has been widely studied for finding sparse solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. The proximal gradient…
We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide…
We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…
In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to…
We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…
There were established the exact-order estimations of the best uniform approximations by{\psi} the trigonometrical polynoms on the $C^{\psi}_{\beta,p}$ classes of $2\pi$-periodic continuous functions $f$, which are defined by the…
We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2k\pi}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on…
The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…
Using recently developed algorithms, we compute and compare best $L^2$ and $L^\infty$ rational approximations of analytic functions on the unit disk. Although there is some theory for these problems going back decades, this may be the first…