Approximation of Length Minimization Problems Among Compact Connected Sets
From MaRDI portal
Publication:5253466
DOI10.1137/14096061XzbMath1319.49075arXiv1403.3004MaRDI QIDQ5253466
Filippo Santambrogio, Matthieu Bonnivard, Antoine Lemenant
Publication date: 26 May 2015
Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3004
Variational problems in a geometric measure-theoretic setting (49Q20) Methods involving semicontinuity and convergence; relaxation (49J45) Length, area, volume, other geometric measure theory (28A75)
Related Items
Connected perimeter of planar sets, Partial regularity for the crack set minimizing the two-dimensional griffith energy, Convex relaxation and variational approximation of the Steiner problem: theory and numerics, Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case, Variational approximation of size-mass energies fork-dimensional currents, A convex approach to the Gilbert-Steiner problem, Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks, Improved stability of optimal traffic paths, Calibrations for minimal networks in a covering space setting, A Modica-Mortola approximation for the Steiner problem, 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, Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\), Phase field models for thin elastic structures with topological constraint, Regularity for the Optimal Compliance Problem with Length Penalization, Strong approximation in \(h\)-mass of rectifiable currents under homological constraint, Phase field approximations of branched transportation problems, Phase field approach to optimal packing problems and related Cheeger clusters, Partial regularity for the optimal \(p\)-compliance problem with length penalization, Stability for the mailing problem, 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$, Learning phase field mean curvature flows with neural networks, Regularity for the planar optimalp-compliance problem, Connected Coulomb columns: analysis and numerics, A selective review on Mumford-Shah minimizers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Derivatives with respect to metrics and applications: subgradient marching algorithm
- A Modica-Mortola approximation for branched transport and applications
- Crack initiation in brittle materials
- Asymptotical compliance optimization for connected networks
- A Modica-Mortola approximation for branched transport
- Singular sets of minimizers for the Mumford-Shah functional
- A variational model for plastic slip and its regularization via \(\Gamma \)-convergence
- Existence and regularity results for the Steiner problem
- Fracture models as \(\Gamma\)-limits of damage models
- Numerical approximation of continuous traffic congestion equilibria
- Counterexample to regularity in average-distance problem
- A Modica-Mortola approximation for the Steiner problem
- Blow-up of optimal sets in the irrigation problem
- Properties of Minimizers of Average-Distance Problem via Discrete Approximation of Measures
- Optimal Partitions for Eigenvalues
- Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rn
- A dacorogna-moser approach to flow decomposition and minimal flow problems
- Optimal Transportation with Traffic Congestion and Wardrop Equilibria
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Efficient algorithms for globally optimal trajectories
- Approximation of Partitions of Least Perimeter by Γ-Convergence: Around Kelvin’s Conjecture
- Reducibility among Combinatorial Problems
- Stationary configurations for the average distance functional and related problems
- A Phase Field Model for the Optimization of the Willmore Energy in the Class of Connected Surfaces
- Steiner Minimal Trees
