Related papers: Minimal Radius Enclosing Polyellipsoids
In this paper we show the existence of strictly monotone heteroclinic type solutions of semilinear elliptic equations in cylinders. The motivation of this construction is twofold: first, it implies the existence of an entire bounded…
We explore connections between the approach of solving the rational interpolation problem via resolutions of ideals and syzygies with the standard method provided by the Extended Euclidean Algorithm. As a consequence, we obtain explicit…
It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. The goal is to recover the…
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
We consider the embedding function $c_b(a)$ describing the problem of symplectically embedding an ellipsoid $E(1,a)$ into the smallest scaling of the polydisc $P(1,b)$. Previous work suggests that determining the entirety of $c_b(a)$ for…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
Recent LLM-driven discoveries have renewed interest in geometric packing problems. In this paper, we study several classes of such packing problems through the lens of modern global nonlinear optimization. Starting from comparatively direct…
In this work, we study resolvent splitting algorithms for solving composite monotone inclusion problems. The objective of these general problems is finding a zero in the sum of maximally monotone operators composed with linear operators.…
We consider the embedding function $c_b(a)$ describing the problem of symplectically embedding an ellipsoid $E(1,a)$ into the smallest possible scaling by $\lambda>1$ of the polydisc $P(1,b)$. In particular, we calculate rigid-flexible…
In recent years, there has been an increasing interest in using deep learning and neural networks to tackle scientific problems, particularly in solving partial differential equations (PDEs). However, many neural network-based methods, such…
The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can convert this problem into a nested sequence of…
Given a set $P$ of $n$ points and a set $S$ of $m$ disks in the plane, the disk coverage problem asks for a smallest subset of disks that together cover all points of $P$. The problem is NP-hard. In this paper, we consider a line-separable…
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
Elliptic partial differential equations are important both from application and analysis points of views. In this paper we apply the Closest Point Method to solving elliptic equations on general curved surfaces. Based on the closest point…
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…
For a given polygonal region $P$, the Lawn Mowing Problem (LMP) asks for a shortest tour $T$ that gets within Euclidean distance 1/2 of every point in $P$; this is equivalent to computing a shortest tour for a unit-diameter cutter $C$ that…
This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…
We look for the minimizers of the functional $\jla{\la}(\oo)=\la|\oo|-P(\oo)$ among planar convex domains constrained to lie into a given ring. We prove that, according to the values of the parameter $\la$, the solutions are either a disc…
This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states…