Approximation of length minimization problems among compact connected sets
From MaRDI portal
Abstract: 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 a term of new type relying on a weighted geodesic distance that forces the minimizers to be connected at the limit. We apply this approach to approximate the so-called Steiner Problem, but also the average distance problem, and finally a problem relying on the p-compliance energy. The proof of convergence of the approximating functional, which is stated in terms of Gamma-convergence relies on technical tools from geometric measure theory, as for instance a uniform lower bound for a sort of average directional Minkowski content of a family of compact connected sets.
Recommendations
- Variational approximation of functionals defined on 1-dimensional connected sets: the planar case
- Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\)
- A Modica-Mortola approximation for the Steiner problem
- On one-dimensional continua uniformly approximating planar sets
- A phase-field approximation of the perimeter under a connectedness constraint
Cites work
- A Dacorogna-Moser approach to flow decomposition and minimal flow problems
- A Modica-Mortola approximation for branched transport
- A Modica-Mortola approximation for branched transport and applications
- A Modica-Mortola approximation for the Steiner problem
- A phase field model for the optimization of the Willmore energy in the class of connected surfaces
- A variational model for plastic slip and its regularization via -convergence
- About the regularity of average distance minimizers in \(\mathbb R^{2}\)
- Approximation of partitions of least perimeter by -convergence: around Kelvin's conjecture
- Asymptotical compliance optimization for connected networks
- Blow-up of optimal sets in the irrigation problem
- Counterexample to regularity in average-distance problem
- Crack initiation in brittle materials
- Derivatives with respect to metrics and applications: subgradient marching algorithm
- Efficient algorithms for globally optimal trajectories
- Existence and regularity results for the Steiner problem
- Fracture models as -limits of damage models
- scientific article; zbMATH DE number 39372 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3567494 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1302349 (Why is no real title available?)
- scientific article; zbMATH DE number 739280 (Why is no real title available?)
- scientific article; zbMATH DE number 1996419 (Why is no real title available?)
- scientific article; zbMATH DE number 1497620 (Why is no real title available?)
- scientific article; zbMATH DE number 1448982 (Why is no real title available?)
- scientific article; zbMATH DE number 3272164 (Why is no real title available?)
- scientific article; zbMATH DE number 3280855 (Why is no real title available?)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Numerical approximation of continuous traffic congestion equilibria
- Optimal partitions for eigenvalues
- Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
- Optimal Transportation with Traffic Congestion and Wardrop Equilibria
- Properties of minimizers of average-distance problem via discrete approximation of measures
- Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rn
- Reducibility among combinatorial problems
- Singular sets of minimizers for the Mumford-Shah functional
- Some explicit examples of minimizers for the irrigation problem
- Stationary configurations for the average distance functional and related problems
- Steiner Minimal Trees
Cited in
(31)- Convex relaxation and variational approximation of the Steiner problem: theory and numerics
- Improved stability of optimal traffic paths
- A fractal shape optimization problem in branched transport
- Convex relaxation and variational approximation of functionals defined on 1-dimensional connected sets
- A phase-field approximation of the Steiner problem in dimension two
- Strong approximation in \(h\)-mass of rectifiable currents under homological constraint
- Partial regularity for the optimal \(p\)-compliance problem with length penalization
- Learning phase field mean curvature flows with neural networks
- Connected perimeter of planar sets
- Partial regularity for the crack set minimizing the two-dimensional griffith energy
- A convex approach to the Gilbert-Steiner problem
- Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\)
- Phase field approximations of branched transportation problems
- Phase field approach to optimal packing problems and related Cheeger clusters
- Stability for the mailing problem
- Theoretical lower bound for border length minimization problem
- A Modica-Mortola approximation for the Steiner problem
- A selective review on Mumford-Shah minimizers
- Variational approximation of functionals defined on 1-dimensional connected sets: the planar case
- Regularity for the planar optimal p-compliance problem
- Connected Coulomb columns: analysis and numerics
- Variational approximation of size-mass energies for k-dimensional currents
- Calibrations for minimal networks in a covering space setting
- Phase field models for thin elastic structures with topological constraint
- A multimaterial transport problem and its convex relaxation via rectifiable G-currents
- A phase-field approximation of the perimeter under a connectedness constraint
- Numerical approximation of the Steiner problem in dimension 2 and 3
- Regularity for the optimal compliance problem with length penalization
- Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks
- Regularity and convergence of critical points of an Ambrosio-Tortorelli functional with linear growth and of its -limit
- Phase-field approximation for one-dimensional shape optimization problems
This page was built for publication: Approximation of length minimization problems among compact connected sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5253466)
