Convex relaxation and variational approximation of the Steiner problem: theory and numerics
DOI10.1515/geofl-2018-0003zbMath1393.49006OpenAlexW2795892747MaRDI QIDQ1647911
Publication date: 27 June 2018
Published in: Geometric Flows (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/geofl-2018-0003
calculus of variationsconvex relaxation\(\Gamma\)-convergencegeometric measure theorySteiner's tree problem
Numerical optimization and variational techniques (65K10) Variational problems in a geometric measure-theoretic setting (49Q20) Planar graphs; geometric and topological aspects of graph theory (05C10) Steiner systems in finite geometry (51E10) Methods involving semicontinuity and convergence; relaxation (49J45) Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Numerical methods of relaxation type (49M20)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- A Modica-Mortola approximation for branched transport and applications
- The Steiner tree problem revisited through rectifiable \(G\)-currents
- On a phase field approximation of the planar Steiner problem: existence, regularity, and asymptotic of minimizers
- Geometric measure theory.
- An optimal irrigation network with infinitely many branching points
- A Convex Approach to Minimal Partitions
- Approximation of Length Minimization Problems Among Compact Connected Sets
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: Convex relaxation and variational approximation of the Steiner problem: theory and numerics