International audienceIn this paper we consider variational problems involving 1-dimensional connected sets in the Euclidean plane, such as the classical Steiner tree problem and the irrigation (Gilbert-Steiner) problem. We relate them to optimal partition problems and provide a variational approximation through Modica-Mortola type energies proving a full Γ-convergence result. We also introduce a suitable convex relaxation and develop the corresponding numerical implementations. The proposed methods are quite general and the results we obtain can be extended to n-dimensional Euclidean space or to more general manifold ambients, as shown in the companion paper [11]
The minimization of the functional G(v)=H(Sv)+∫∂Ω m·v-∫Ω k·v is related to various geometrical type ...
We propose a newapproximation for the relaxed energy E of the Dirichlet energy and prove that the mi...
The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirecte...
In this paper we consider variational problems involving 1-dimensional connected sets in the Euclide...
In this short note we announce the main results about variational problems involving 1-dimensional c...
In this thesis we investigate variational problems involving 1-dimensional sets (e.g., curves, netwo...
We describe a convex relaxation for the Gilbert-Steiner problem both in R d and on manifolds, extend...
Abstract. In this note we present a way to approximate the Steiner problem by a family of elliptic e...
We consider a general class of variational inequality problems in a finite-dimensional space setting...
International audienceMinimal partition problems consist in finding a partition of a domain into a g...
. The variational inequality problem is reduced to an optimization problem with a differentiable obj...
International audienceIn this article, we consider and analyse a small variant of a functional origi...
This book deals with the new class of one-dimensional variational problems - the problems with branc...
The M α energy which is usually minimized in branched transport problems among singular one-dimensio...
In this paper we provide an approximation à la Ambrosio-Tortorelli of some classical minimization pr...
The minimization of the functional G(v)=H(Sv)+∫∂Ω m·v-∫Ω k·v is related to various geometrical type ...
We propose a newapproximation for the relaxed energy E of the Dirichlet energy and prove that the mi...
The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirecte...
In this paper we consider variational problems involving 1-dimensional connected sets in the Euclide...
In this short note we announce the main results about variational problems involving 1-dimensional c...
In this thesis we investigate variational problems involving 1-dimensional sets (e.g., curves, netwo...
We describe a convex relaxation for the Gilbert-Steiner problem both in R d and on manifolds, extend...
Abstract. In this note we present a way to approximate the Steiner problem by a family of elliptic e...
We consider a general class of variational inequality problems in a finite-dimensional space setting...
International audienceMinimal partition problems consist in finding a partition of a domain into a g...
. The variational inequality problem is reduced to an optimization problem with a differentiable obj...
International audienceIn this article, we consider and analyse a small variant of a functional origi...
This book deals with the new class of one-dimensional variational problems - the problems with branc...
The M α energy which is usually minimized in branched transport problems among singular one-dimensio...
In this paper we provide an approximation à la Ambrosio-Tortorelli of some classical minimization pr...
The minimization of the functional G(v)=H(Sv)+∫∂Ω m·v-∫Ω k·v is related to various geometrical type ...
We propose a newapproximation for the relaxed energy E of the Dirichlet energy and prove that the mi...
The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirecte...