Related papers: Calibration for minimal surfaces with free boundar…
We study certain obstacle type problems involving standard and nonlocal minimal surfaces. We obtain optimal regularity of the solution and a characterization of the free boundary.
We prove optimal regularity and a detailed analysis of the free boundary of the solutions to the thin obstacle problem for nonparametric minimal surfaces with flat obstacles.
We study a class of semilinear free boundary problems in which admissible functions $u$ have a topological constraint, or spanning condition, on their 1-level set. This constraint forces $\{u=1\}$, which is the free boundary, to behave like…
Given an open and bounded set $\Omega\subset\mathbb{R}^N$, we consider the problem of minimizing the ratio between the $s-$perimeter and the $N-$dimensional Lebesgue measure among subsets of $\Omega$. This is the nonlocal version of the…
Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of Steiner problem in several variants. Our goal is to compare the…
We consider Cheeger-like shape optimization problems of the form $$\min\big\{|\Omega|^\alpha J(\Omega) : \Omega\subset D\big\}$$ where $D$ is a given bounded domain and $\alpha$ is above the natural scaling. We show the existence of a…
In this paper we consider three minimization problems, namely quadratic, $\rho$-convex and quadratic fractional programing problems. The quadratic problem is considered with quadratic inequality constraints with bounded continuous and…
We construct two minimal Cheeger sets in the Euclidean plane, i.e. unique minimizers of the ratio "perimeter over area" among their own measurable subsets. The first one gives a counterexample to the so-called weak regularity property of…
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…
In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the…
We perform a replacement procedure in order to produce a free boundary minimal surface whose area achieves the min-max value over all disk sweepouts of a manifold whose boundary lie in a submanifold. Our result is based on a proof of the…
We study an inhomogeneous minimization problems associated to the $p(x)$-Laplacian. We make a thorough analysis of the essential properties of their minimizers and we establish a relationship with a suitable free boundary problem. On the…
In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…
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…
The divergence minimization problem plays an important role in various fields. In this note, we focus on differentiable and strictly convex divergences. For some minimization problems, we show the minimizer conditions and the uniqueness of…
In this article it is shown that the equilateral triangle maximizes the Cheeger constant and minimizes the torsional rigidity among shapes having a fixed minimal width. The proof techniques use direct comparisons with simpler shapes,…
Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…
Finite element approximations of minimal surface are not always precise. They can even sometimes completely collapse. In this paper, we provide a simple and inexpensive method, in terms of computational cost, to improve finite element…
Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…
Recently Fraser and Schoen showed that the solution of a certain extremal Steklov eigenvalue problem on a compact surface with boundary can be used to generate a free boundary minimal surface, i.e., a surface contained in the ball that has…