English
Related papers

Related papers: Optimal Polynomial Approximants in $L^p$

200 papers

Polynomials known as Multiple Orthogonal Polynomials in a single variable are polynomials that satisfy orthogonality conditions concerning multiple measures and play a significant role in several applications such as Hermite-Pad\'e…

Classical Analysis and ODEs · Mathematics 2026-01-13 Lidia Fernández , Juan Antonio Villegas

In this paper we study optimal control problems with either fractional or regional fractional $p$-Laplace equation, of order $s$ and $p\in [2,\infty)$, as constraints over a bounded open set with Lipschitz continuous boundary. The control,…

Optimization and Control · Mathematics 2017-01-20 Harbir Antil , Mahamadi Warma

We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all…

Complex Variables · Mathematics 2024-06-14 Olivier Sète , Jan Zur

This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…

Computational Complexity · Computer Science 2025-09-01 Mrinalkanti Ghosh

Online linear programming (OLP) has gained significant attention from both researchers and practitioners due to its extensive applications, such as online auction, network revenue management, order fulfillment and advertising. Existing OLP…

Data Structures and Algorithms · Computer Science 2025-11-18 Guokai Li , Zizhuo Wang , Jingwei Zhang

The proximal point algorithm (PPA) has been well studied in the literature. In particular, its linear convergence rate has been studied by Rockafellar in 1976 under certain condition. We consider a generalized PPA in the generic setting of…

Optimization and Control · Mathematics 2016-05-19 Min Tao , Xiaoming Yuan

In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly more precise LP relaxations based on expressing the given…

Optimization and Control · Mathematics 2015-09-04 Mohamed Amin Ben Sassi , Sriram Sankaranarayanan

We extend the Pontryagin Maximum Principle (PMP) to the geometric setting of almost-Lie (AL) algebroids -- objects which generalize Lie algebroids. The result may be understood as a very general reduction scheme for optimal control problems…

Optimization and Control · Mathematics 2011-11-08 Michal Jozwikowski

For all functions on an arbitrary open set $\Omega\subset\R^3$ with zero boundary values, we prove the optimal bound \[ \sup_{\Omega}|u| \leq (2\pi)^{-1/2} \left(\int_{\Omega}|\nabla u|^2 \,dx\, \int_{\Omega}|\Delta u|^2 \,dx\right)^{1/4}.…

Analysis of PDEs · Mathematics 2008-02-03 Wenzheng Xie

In this work we prove optimal $W^{s,p}$-approximation estimates (with $p\in[1,+\infty]$) for elliptic projectors on local polynomial spaces. The proof hinges on the classical Dupont--Scott approximation theory together with two novel…

Numerical Analysis · Mathematics 2017-03-08 Daniele Di Pietro , Jerome Droniou

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…

Optimization and Control · Mathematics 2025-01-07 Lai Tian , Anthony Man-Cho So

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…

Numerical Analysis · Mathematics 2021-02-26 Aleš Vavpetič , Emil Žagar

In this paper we study optimal lower and upper bounds for functionals involving the first Dirichlet eigenvalue $\lambda_{F}(p,\Omega)$ of the anisotropic $p$-Laplacian, $1<p<+\infty$. Our aim is to enhance how, by means of the $\mathcal…

Analysis of PDEs · Mathematics 2017-10-10 Francesco Della Pietra , Giuseppina di Blasio , Nunzia Gavitone

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

Optimization and Control · Mathematics 2021-12-06 Ankit Garg , Robin Kothari , Praneeth Netrapalli , Suhail Sherif

Let $(\Omega,\Sigma,\mu)$ be a measure space and $1< p < +\infty$. In this paper we show that, under quite general conditions, the set $L_{p}(\Omega) - \bigcup\limits_{1 \leq q < p}L_{q}(\Omega)$ is maximal spaceable, that is, it contains…

Functional Analysis · Mathematics 2015-10-02 G. Botelho , D. Cariello , V. V. Fávaro , D. Pellegrino , J. B. Seoane-Sepúlveda

We propose and analyze a randomized zeroth-order approach based on approximating the exact gradient byfinite differences computed in a set of orthogonal random directions that changes with each iteration. A number ofpreviously proposed…

Optimization and Control · Mathematics 2021-11-16 David Kozak , Cesare Molinari , Lorenzo Rosasco , Luis Tenorio , Silvia Villa

We present incomplete gamma kernels, a generalization of Locally Optimal Projection (LOP) operators. In particular, we reveal the relation of the classical localized $ L_1 $ estimator, used in the LOP operator for point cloud denoising, to…

Computer Vision and Pattern Recognition · Computer Science 2024-10-29 Patrick Stotko , Michael Weinmann , Reinhard Klein

We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…

Numerical Analysis · Mathematics 2022-11-15 Marco Fasondini , Sheehan Olver , Yuan Xu

We investigate the Hilbert transform and the maximal operator along a class of variable non-flat polynomial curves $(P(t),u(x)t)$ with measurable $u(x)$, and prove uniform $L^p$ estimates for $1<p<\infty$. In particular, via the change of…

Classical Analysis and ODEs · Mathematics 2023-06-01 Renhui Wan

The problem of estimating the pth moment F_p (p nonnegative and real) in data streams is as follows. There is a vector x which starts at 0, and many updates of the form x_i <-- x_i + v come sequentially in a stream. The algorithm also…

Data Structures and Algorithms · Computer Science 2009-04-09 Daniel M. Kane , Jelani Nelson , David P. Woodruff