Related papers: Some problems on optimal approximants

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

We study the minimax problem for restricted two-fold self-sumsets in $k$-colorings of $\mathbb{Z}_n$. For primes $p$ with $2\le k\le p$ we determine the exact minimum $\max\{0,\,2\lceil p/k\rceil-3\}$. For general $n$ (with $m=\lceil…

We prove regularity estimates for weak solutions to the Dirichlet problem for a divergence form elliptic operator. We give $L^p$ estimates for the second derivative for $p<2$. Our work generalizes results due to Miranda [28].

In this paper we study the auxiliary problems that appear in $p$-order tensor methods for unconstrained minimization of convex functions with $\nu$-H\"{o}lder continuous $p$th derivatives. This type of auxiliary problems corresponds to the…

In this note we are concerned with interior regularity properties of the $p$-Poisson problem $\Delta_p(u)=f$ with $p>2$. For all $0<\lambda\leq 1$ we constuct right-hand sides $f$ of differentiability $-1+\lambda$ such that the (Besov-)…

The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…

We present an optimization problem emerging from optimal control theory and situated at the intersection of fractional programming and linear max-min programming on polytopes. A na\"ive solution would require solving four nested, possibly…

We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

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,…

We consider a new type of obstacle problem in the cylindrical domain $\Omega=D\times (0,1)$ arising from minimization of the functional $$ \int_\Omega \frac{1}{2}|\nabla u|^2+\chi_{\{v>0\}}udx, $$ where $v(x')=\int_0^1 u(x', t) dt $. We…

We present a class of linear programming approximations for constrained optimization problems. In the case of mixed-integer polynomial optimization problems, if the intersection graph of the constraints has bounded tree-width our…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

We present an extension of an algorithm for the classical scalar $p$-Laplace Dirichlet problem to the vector-valued $p$-Laplacian with mixed boundary conditions in order to solve problems occurring in shape optimization using a $p$-harmonic…

We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…

In this paper we study two optimal design problems associated to fractional Sobolev spaces $W^{s,p}(\Omega)$. Then we find a relationship between these two problems and finally we investigate the convergence when $s\uparrow 1$.

We investigate the best constants for the regional fractional $p$-Poincar\'e inequality and the fractional $p$-Poincar\'e inequality in cylindrical domains. For the special case $p=2$, the result was already known due to…

Inside a fixed bounded domain $\Omega$ of the plane, we look for the best compact connected set $K$, of given perimeter, in order to maximize the first Dirichlet eigenvalue $\lambda_1(\Omega\setminus K)$. We discuss some of the qualitative…