Related papers: Quadratic Crofton and sets that see themselves as …

We study minimizers of non-autonomous energies with minimal growth and coercivity assumptions on the energy. We show that the minimizer is nevertheless the solution of the relevant Euler--Lagrange equation or inequality. The main tool is an…

We consider the problem of minimizing the bending or elastic energy among Jordan curves confined in a given open set $\Omega$. We prove existence, regularity and some structural properties of minimizers. In particular, when $\Omega$ is…

We study the problem of finding the one-dimensional structure in a given data set. In other words we consider ways to approximate a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of…

Recall that Janson showed that if the edges of the complete graph $K_n$ are assigned exponentially distributed independent random weights, then the expected length of a shortest path between a fixed pair of vertices is asymptotically equal…

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) :=…

We consider the approximation of minimal geodesics between two closed sets in $\mathbb{R}^D$ endowed with a smooth Riemannian metric. The continuous problem is formulated as the minimization of the energy functional over piecewise smooth…

For $\Omega$ a perturbation of the unit ball in $\mathbb{R}^3$, we establish the existence of a sequence of local minimizers for the vector Allen-Cahn energy. The sequence converges in $L^1$ to a partition of $\Omega$ whose skeleton is…

We establish some relations between the perimeter, the area and the visual angle of a planar compact convex set. Our first result states that Crofton's formula is the unique universal formula relating the visual angle, length and area.…

This paper studies approximate solutions of a linear fractional vector optimization problem without requiring boundedness of the constraint set. We establish necessary and sufficient conditions for approximating weakly efficient points of…

In this paper we prove that the shape optimization problem $$\min\left\{\lambda_k(\Omega):\ \Omega\subset\R^d,\ \Omega\ \hbox{open},\ P(\Omega)=1,\ |\Omega|<+\infty\right\},$$ has a solution for any $k\in\N$ and dimension $d$. Moreover,…

We study existence, unicity and other geometric properties of the minimizers of the energy functional $$ \|u\|^2_{H^s(\Omega)}+\int_\Omega W(u)\,dx, $$ where $\|u\|_{H^s(\Omega)}$ denotes the total contribution from $\Omega$ in the $H^s$…

We consider the functional $$I_\Omega(v) = \int_\Omega [f(|Dv|) - v] dx,$$ where $\Omega$ is a bounded domain and $f$ is a convex function. Under general assumptions on $f$, G. Crasta [Cr1] has shown that if $I_\Omega$ admits a minimizer in…

We study minimizers of the Allen-Cahn system. We consider the $ \varepsilon $-energy functional with Dirichlet values and we establish the $ \Gamma $-limit. The minimizers of the limiting functional are closely related to minimizing…

Energy functionals describing phase transitions in crystalline solids are often non-quasiconvex and minimizers might therefore not exist. On the other hand, there might be infinitely many gradient Young measures, modelling microstructures,…

Given $\Omega$ bounded open set of $\mathbb R^{n}$ and $\alpha\in \mathbb R$, let us consider \[ \mu(\Omega,\alpha)=\min_{\substack{v\in W_{0}^{1,2}(\Omega)\\v\not\equiv 0}} \frac{\displaystyle\int_{\Omega} |\nabla v|^{2}dx+\alpha…

An approach to modelling random sets with locally finite perimeter as random elements in the corresponding subspace of $L^1$ functions is suggested. A Crofton formula for flat sections of the perimeter is shown. Finally, random processes of…

The aim of this paper is to present an original approach that takes advantage from the geometric features of strictly convex functions to tackle the problem of finding the minimum from another perspective. The general idea is that near the…

Let $\Omega \subset \mathbb{R}^2$ be a bounded, convex set. A set $O \subset \mathbb{R}^2$ is an opaque set (for $\Omega$) if every line that intersects $\Omega$ also intersects $O$. What is the minimal possible length $L$ of an opaque set?…

We systematically explore a class of constrained optimization problems with linear objective function and constraints that are linear combinations of logarithms of the optimization variables. Such problems can be viewed as a generalization…

We study the problem of minimizing the energy function $M^p(m,n) := \min \sum_{1\le i<j\le m} |\langle v_i, v_j\rangle|^p$, where $v_i$ are unit vectors in $F^n$, $F=\mathbb R$ or $\mathbb C$, $m,n,p>0$ are integers and $p$ is even. This…