A convex approach to the Gilbert-Steiner problem
From MaRDI portal
Publication:2194559
DOI10.4171/IFB/436zbMath1448.49019arXiv1810.05417MaRDI QIDQ2194559
Publication date: 26 August 2020
Published in: Interfaces and Free Boundaries (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.05417
Steiner problemcalculus of variationsconvex relaxationcalibrationsGilbert-Steiner problemminimal networks on surfaces
Related Items (2)
Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks ⋮ Learning phase field mean curvature flows with neural networks
Uses Software
Cites Work
- Constrained BV functions on covering spaces for minimal networks and Plateau's type problems
- A Modica-Mortola approximation for branched transport and applications
- The Steiner tree problem revisited through rectifiable \(G\)-currents
- Optimal transportation networks. Models and theory
- Adaptive finite element methods for a class of evolution problems in viscoplasticity
- Integral representation of convex functions on a space of measures
- Functionals defined on partitions in sets of finite perimeter. I: Integral representation and Gamma-convergence
- Functionals defined on partitions in sets of finite perimeter. II: Semicontinuity, relaxation and homogenization
- Approximation schemes for NP-hard geometric optimization problems: a survey
- Numerical calibration of Steiner trees
- A phase-field approximation of the Steiner problem in dimension two
- On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs
- Lectures on Modern Convex Optimization
- An optimal irrigation network with infinitely many branching points
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- An Algorithm for Restricted Least Squares Regression
- Mixed and Hybrid Finite Element Methods
- Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
- A Convex Approach to Minimal Partitions
- Numerical approximation of the Steiner problem in dimension $2$ and $3$
- Approximation of Length Minimization Problems Among Compact Connected Sets
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: A convex approach to the Gilbert-Steiner problem
