Variational approximation of functionals defined on 1-dimensional connected sets: the planar case

DOI10.1137/17M1159452zbMATH Open1404.49006arXiv1610.03839WikidataQ128749769 ScholiaQ128749769MaRDI QIDQ4562017FDOQ4562017

Mauro Bonafini, Giandomenico Orlandi, Edouard Oudet

Publication date: 14 December 2018

Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)

Abstract: In 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 $Gamma$-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].

Full work available at URL: https://arxiv.org/abs/1610.03839

Recommendations

• Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\)
• Convex relaxation and variational approximation of functionals defined on 1-dimensional connected sets
• Approximation of length minimization problems among compact connected sets
• Numerical calibration of Steiner trees
• On a phase field approximation of the planar Steiner problem: existence, regularity, and asymptotic of minimizers

zbMATH Keywords

convex relaxation\(\Gamma\)-convergencecalculus of variationsoptimal partitionsgeometric measure theoryGilbert-Steiner problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational problems in a geometric measure-theoretic setting (49Q20) Methods involving semicontinuity and convergence; relaxation (49J45) Numerical methods of relaxation type (49M20) Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Steiner systems in finite geometry (51E10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Geometric measure theory.
• Nonconvex variational problems with anisotropic perturbations
• Title not available (Why is that?)
• Title not available (Why is that?)
• A notion of total variation depending on a metric with discontinuous coefficients
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Approximation of Length Minimization Problems Among Compact Connected Sets
• Steiner Minimal Trees
• Title not available (Why is that?)
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
• Optimal transportation networks. Models and theory
• Functionals defined on partitions in sets of finite perimeter. II: Semicontinuity, relaxation and homogenization
• A Convex Approach to Minimal Partitions
• Existence and regularity results for the Steiner problem
• Approximation schemes for NP-hard geometric optimization problems: a survey
• Size minimization and approximating problems
• A Benamou–Brenier Approach to Branched Transport
• Singular perturbations of variational problems arising from a two-phase transition model
• Ginzburg-Landau minimizers from R^{n+1} to R^n and minimal connections
• Functionals defined on partitions in sets of finite perimeter. I: Integral representation and Gamma-convergence
• Variational convergence for functionals of Ginzburg-Landau type
• Clusters with multiplicities in \(\mathbb R^2\)
• A Modica-Mortola approximation for branched transport and applications
• The Steiner tree problem revisited through rectifiable \(G\)-currents
• An optimal irrigation network with infinitely many branching points
• Codimension one minimal cycles with coefficients in \(Z\) or \(Z_p\), and variational functionals on fibered spaces
• On a phase field approximation of the planar Steiner problem: existence, regularity, and asymptotic of minimizers
• Title not available (Why is that?)
• Numerical calibration of Steiner trees

Cited In (17)

• Variational approximation of size-mass energies fork-dimensional currents
• Calibrations for minimal networks in a covering space setting
• Convex relaxation and variational approximation of functionals defined on 1-dimensional connected sets
• Numerical approximation of the Steiner problem in dimension $2$ and $3$
• A fractal shape optimization problem in branched transport
• Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\)
• Minimizing properties of networks via global and local calibrations
• Stability for the mailing problem
• Improved stability of optimal traffic paths
• On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\)
• Optimal micropatterns in 2D transport networks and their relation to image inpainting
• Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks
• A convex approach to the Gilbert-Steiner problem
• Learning phase field mean curvature flows with neural networks
• A phase-field approximation of the Steiner problem in dimension two
• The oriented mailing problem and its convex relaxation
• A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents

Uses Software

• KNITRO
• GeoSteiner

This page was built for publication: Variational approximation of functionals defined on 1-dimensional connected sets: the planar case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4562017)