Related papers: The missing (A, D, r) diagram

An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

Given a convex set $\Omega$ of $\mathbb{R}^n$, we consider the shape optimization problem of finding a convex subset $\omega\subset \Omega$, of a given measure, minimizing the $p$-distance functional $$\mathcal{J}_p(\omega) :=…

In this paper we derive a moment relaxation for large-scale nonsmooth optimization problems with graphical structure and spherical constraints. In contrast to classical moment relaxations for global polynomial optimization that suffer from…

Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…

Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…

The Blaschke-Lebesgue Theorem states that among all planar convex domains of given constant width B the Reuleaux triangle has minimal area. It is the purpose of the present note to give a direct proof of this theorem by analyzing the…

We verify the inequality $$ \frac{|K|}{|E|}+\frac{|K^*|}{|E^*|}\leq 2 $$ for any $o$-symmetric convex body $K\subset\mathbb{R}^2$ where $E$ is either the John ellipse of maximal area contained in $K$ or the minimal area L\"owner ellipse…

In this paper, we extend and generalize several previous works on maximal-volume positions of convex bodies. First, we analyze the maximal positive-definite image of one convex body inside another, and the resulting decomposition of the…

In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and…

In this paper we address the following shape optimization problem: find the planar domain of least area, among the sets with prescribed constant width and inradius. In the literature, the problem is ascribed to Bonnesen, who proposed it in…

Given a finite sequence of vectors $\mathcal F_0$ in $\C^d$ we describe the spectral and geometrical structure of optimal completions of $\mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality…

In this paper, we begin by constructing global linear maps on (n-2)-dimensional subspaces, derived from the local continuity of linear transformations among central sections of a convex body. Using these linear maps, we subsequently…

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

This paper settles the existence question for a rather general class of convex optimal design problems with a volume constraint. In low dimensions, we prove the existence of an optimal configuration for general convex minimization problems…

We are interested in the optimization of convex domains under a PDE constraint. Due to the difficulties of approximating convex domains in $\mathbb{R}^3$, the restriction to rotationally symmetric domains is used to reduce shape…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Many classical problems in convex geometry can be cast as optimization problems under certain containment conditions. The arguably best-understood example is volume-maximization of convex bodies contained in other convex bodies, where the…