相关论文: On minimizers of the maximal distance functional f…
We study the properties of sets $\Sigma$ which are the solutions of the maximal distance minimizer problem, id est of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…
Consider a compact $M \subset \mathbb{R}^d$ and $r > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the minimal length, such that \[ \max_{y \in M} dist (y, \Sigma) \leq r. \] The inverse problem is…
Consider a compact $M \subset \mathbb{R}^d$ and $l > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the length (one-dimensional Hausdorff measure $\mathcal H$) at most $l$ that minimizes \[ \max_{y…
\emph{A maximal distance minimizer} for a given compact set $M \subset \mathbb{R}^2$ and some given $r > 0$ is a set having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…
We study the properties of sets $\Sigma$ having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset \mathbb{R}^2$ satisfying the inequality $\mbox{max}_{y \in M}…
In this work, I collect and discuss a series of open questions in one-dimensional geometric optimization in Euclidean spaces. The focus is on two classes of problems: maximal distance minimizers and Steiner trees. Maximal distance…
Given a compact $E \subset \mathbb{R}^n$ and $s > 0$, the maximum distance problem seeks a compact and connected subset of $\mathbb{R}^n$ of smallest one dimensional Hausdorff measure whose $s$-neighborhood covers $E$. For $E\subset…
We study the properties of sets $\Sigma$ which are the solutions of the maximal distance minimizer problem, i.e. of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…
The problem of finding the minimizer of a sum of convex functions is central to the field of distributed optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the…
The optimization problem concerning the determination of the minimizer for the sum of convex functions holds significant importance in the realm of distributed and decentralized optimization. In scenarios where full knowledge of the…
The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…
In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…
We study the minimax problem $\min_{x\in M} \max_y f_r(x,y):=f(x,y)-h(y)$, where $M$ is a compact submanifold, $f$ is continuously differentiable in $(x, y)$, $h$ is a closed, weakly-convex (possibly non-smooth) function and we assume that…
We consider a family of functionals $J$ to be maximized over the planar convex sets $K$ for which the perimeter and Steiner point have been fixed. Assuming that $J$ is the integral of a quadratic expression in the support function $h$, we…
In this article, we prove that there exists a unique perimeter minimizer among all piecewise smooth simple closed curves in $M_{\kappa}^2$ enclosing area $A > 0$ $(A \leq 2{\pi}$ if ${\kappa} = 1)$, and it is a circle in $M_{\kappa}^2$ of…
We look for minimizers of the buckling load problem with perimeter constraint in any dimension. In dimension 2, we show that the minimizing plates are convex; in higher dimension, by passing through a weaker formulation of the problem, we…
We prove some regularity results for a connected set S in the planar domain O, which minimizes the compliance of its complement O\S, plus its length. This problem, interpreted as to find the best location for attaching a membrane subject to…
Finding the minimum and the minimizers of convex functions has been of primary concern in convex analysis since its conception. It is well-known that if a convex function has a minimum, then that minimum is global. The minimizers, however,…
We construct an example of an infinite planar embedded self-similar binary tree $\Sigma$ which is the essentially unique solution to the Steiner problem of finding the shortest connection of a given planar self-similar fractal set $C$ of…
In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional $\int \sqrt{1+K_\gamma^2} ds$, depending both on length and curvature $K$. We fix starting and ending points…