English
Related papers

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

200 papers

The multi-objective optimization is to optimize several objective functions over a common feasible set. Since the objectives usually do not share a common optimizer, people often consider (weakly) Pareto points. This paper studies…

Optimization and Control · Mathematics 2023-12-05 Jiawang Nie , Zi Yang

We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…

Numerical Analysis · Mathematics 2013-01-10 David I. Ketcheson , Aron J. Ahmadia

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

Discrete Mathematics · Computer Science 2020-05-18 Christopher Hojny , Marc E. Pfetsch , Matthias Walter

Let $\Omega$ be a bounded, smooth domain of $\mathbb{R}^{N},$ $N\geq1.$ For each $p>N$ we study the optimal function $s=s_{p}$ in the pointwise inequality \[ \left\vert v(x)\right\vert \leq s(x)\left\Vert \nabla v\right\Vert…

Analysis of PDEs · Mathematics 2020-04-21 Grey Ercole , Gilberto de Assis Pereira

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

Data Structures and Algorithms · Computer Science 2017-04-25 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

An algorithm for unconstrained non-convex optimization is described, which does not evaluate the objective function and in which minimization is carried out, at each iteration, within a randomly selected subspace. It is shown that this…

Optimization and Control · Mathematics 2025-01-31 S. Bellavia , S. Gratton , B. Morini , Ph. L. Toint

In this paper we investigate the asymptotic distribution of the zeros of polynomials $P_{n}(x)$ satisfying a first order differential-difference equation. We give several examples of orthogonal and non-orthogonal families.

Classical Analysis and ODEs · Mathematics 2013-12-04 Diego Dominici , Walter Van Assche

Hybrid High-Order methods for elliptic diffusion problems have been originally formulated for loads in the Lebesgue space $L^2(\Omega)$. In this paper we devise and analyze a variant thereof, which is defined for any load in the dual…

Numerical Analysis · Mathematics 2019-05-01 Alexandre Ern , Pietro Zanotti

In 2003, Del Pino and Dolbeault [14] and Gentil [19] investigated, independently, best constants and extremals associated to Euclidean Lp-entropy inequalities for p > 1. In this work, we present some contributions in the Riemannian context.…

Analysis of PDEs · Mathematics 2016-02-04 Jurandir Ceccon , Marcos Montenegro

We discuss the L^p-boundedness of maximal singular integrals in the plane over a finite set V of N directions. Logarithmic bounds are established for a set V of arbitrary structure in the 2<=p<infinity range. Sharp bounds are proved for…

Classical Analysis and ODEs · Mathematics 2012-03-30 Ciprian Demeter , Francesco Di Plinio

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

Complex Variables · Mathematics 2016-09-27 Eze R. Nwaeze

We use localized topologies to prove existence and optimal regularity results for the divergence equation $\mathrm{div} (v) = F$ in critical cases $v \in L_1(\Omega;\mathbb{R}^m)$ or $v \in C_0(\Omega;\mathbb{R}^m)$, i.e. we characterize…

Analysis of PDEs · Mathematics 2026-03-20 Thierry De Pauw

We consider ILPs, where each variable corresponds to an integral point within a polytope $\mathcal{P}$, i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathbb Z^d} x_p p = b, x\in\mathbb Z^{|\mathcal P\cap \mathbb…

Computational Complexity · Computer Science 2020-10-20 Sebastian Berndt , Klaus Jansen , Alexandra Lassota

Linear Complementarity Problems (LCPs) with sufficient matrices form an important subclass of LCPs, and it remains a significant open question whether problems in this class can be solved in polynomial time. Kojima, Megiddo, Noma, and…

Optimization and Control · Mathematics 2026-05-12 Marianna E. -Nagy , László A. Végh

We study the maximal number $0\le h\le+\infty$ for a given plane domain $\Omega$ such that $f\in H^p$ whenever $p<h$ and $f$ is analytic in the unit disk with values in $\Omega.$ One of our main contributions is an estimate of $h$ for…

Complex Variables · Mathematics 2010-03-09 Yong Chan Kim , Toshiyuki Sugawa

In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…

Optimization and Control · Mathematics 2025-09-09 Daniel Reem , Yair Censor

We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem…

Computational Complexity · Computer Science 2007-05-23 Steffen Reith , Heribert Vollmer

We establish a higher dimensional counterpart of Bourgain's pointwise ergodic theorem along an arbitrary integer-valued polynomial mapping. We achieve this by proving variational estimates $V_r$ on $L^p$ spaces for all $1<p<\infty$ and…

Classical Analysis and ODEs · Mathematics 2014-05-23 Mariusz Mirek , Bartosz Trojan

We obtain closed expressions for weighted orthogonal polynomials and optimal approximants associated with the function $f(z)=1-\frac{1}{\sqrt{2}}(z_1+z_2)$ and a scale of Hilbert function spaces in the unit $2$-ball having reproducing…

Complex Variables · Mathematics 2021-10-28 Meredith Sargent , Alan A. Sola

We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a \PTAS. For the weighted case,…

Computational Geometry · Computer Science 2011-03-09 Timothy M. Chan , Sariel Har-Peled
‹ Prev 1 8 9 10 Next ›