Related papers: The missing (A, D, r) diagram
In this paper we study optimization problems for Neumann eigenvalues $\mu_k$ among convex domains with a constraint on the diameter or the perimeter. We work mainly in the plane, though some results are stated in higher dimension. We study…
Nonlinear Poincar\'e inequalities are indispensable tools in the study of dimension reduction and low-distortion embeddings of graphs into metric spaces, and have found remarkable algorithmic applications. A basic open problem, posed by Jon…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We study the regularity of solutions to an optimal transportation problem where the dimension of the source is larger than that of the target. We demonstrate that if the target is $c$-convex, then the source has a canonical foliation whose…
This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.
This paper exemplifies that saturation is an indispensable structure on measure spaces to obtain the existence and characterization of solutions to nonconvex variational problems with integral constraints in Banach spaces and their dual…
This paper investigates general and generalized differentiation properties of the optimal value function associated with perturbed optimization problems. Fundamental results on nearly convex sets and functions in infinite-dimensional spaces…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the $n$-dimensional to the $q$-dimensional Euclidean space whose graph is a convex polyhedron. This problem can be seen as the most elementary…
We consider a series of optimal control problems with 2-dimensional control lying in an arbitrary convex compact set $\Omega$. The considered problems are well studied for the case when $\Omega$ is a unit disc, but barely studied for…
For a given $\lambda >0$, a convex body in $\mathbb R^n$ is $\lambda$-convex if it is the intersection of (finitely or infinitely many) balls of radius $1/\lambda$. In this note, we show that among all $\lambda$-convex bodies in $\mathbb…
Neumann eigenvalues being non-decreasing with respect to domain inclusion, it makes sense to study the two shape optimization problems $\min\{\mu_k(\Omega):\Omega \mbox{ convex},\Omega \subset D, \}$ (for a given box $D$) and…
In convex geometry, the Blaschke surface area measure on the boundary of a convex domain can be interpreted in terms of the complexity of approximating polyhedra. In response to a question raised by D. Barrett, this approach is formulated…
In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…
A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered as vertices in $G$ is equal to $d$. Such a realisation…
The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
We consider two different variational models of transport networks, the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field,…
Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…