Related papers: Almost optimal polynomial approximation on convex …
Considering a mapping g holomorphic on a neighbourhood of a rationally convex set K in $C^n$, and range into the complex projective space $P^m$, the main objective of this paper is to show that we can uniformly approximate g on K by…
We present an explicit formula for the orthogonal projection onto the subspace of analytic polynomials of degree at most $n$ in the local Dirichlet space $D_\mu$ , where the positive measure $\mu$ consists of a finite number of Dirac…
We show that the global minimum (resp. maximum) of a continuous function on a compact set can be approximated from above (resp. from below) by computing the smallest (rest. largest) eigenvalue of a hierarchy of (r x r) tri-diagonal…
In the presence of a positive, compactly supported measure on an affine algebraic curve, we relate the density of polynomials in Lebesgue $L^2$-space to the existence of analytic bounded point evaluations. Analogues to the complex plane…
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
We research proximinality of $\mu$-sequentially compact sets and $\mu$-compact sets in measurable function spaces. Next we show a correspondence between the Kadec-Klee property for convergence in measure and $\mu$-compactness of the sets in…
The most important uniform algebra is the family of continuous functions on a compact subset $K$ of the complex plane $\mathbb{C}$ which are analytic on the interior int$(K)$ For compact sets $K$ which are regular (i.e. $K =$int$(K)$ and…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
We describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons. Our algorithm works by extending the result of Adamaszek and Wiese \cite{aw-asmwi-13, aw-qmwis-14} to polygons of…
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
In this paper, we study the problem of computing by relaxation hierarchies the infimum of a real polynomial function f on a closed basic semialgebraic set and the points where this infimum is reached, if they exist. We show that when the…
This article addresses structure-preserving smooth approximation of semiconcave functions. semiconcave functions are of particular interest because they naturally arise in a variety of variational problems, including {optimal feedback…
Locating proximal points is a component of numerous minimization algorithms. This work focuses on developing a method to find the proximal point of a convex function at a point, given an inexact oracle. Our method assumes that exact…
The focus of this article is the approximation of functions which are analytic on a compact interval except at the endpoints. Typical numerical methods for approximating such functions depend upon the use of particular conformal maps from…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
A self-affine tiling of a compact set G of positive Lebesgue measure is its partition to parallel shifts of a compact set which is affinely similar to G. We find all polyhedral sets (unions of finitely many convex polyhedra) that admit…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of…