A fractal shape optimization problem in branched transport
DOI10.1016/j.matpur.2018.06.007zbMath1408.49041arXiv1709.01415OpenAlexW2962893512WikidataQ129685232 ScholiaQ129685232MaRDI QIDQ1726952
Filippo Santambrogio, Qinglan Xia, Paul Pegon
Publication date: 20 February 2019
Published in: Journal de Mathématiques Pures et Appliquées. Neuvième Série (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.01415
nonsmooth optimizationshape optimization problemfractal dimensionbranched transportlandscape functionMorrey-Campanato spacesphase-field approximation
Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Regularity of solutions in optimal control (49N60) Optimization of shapes other than minimal surfaces (49Q10) Fractals (28A80)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Congestion-driven dendritic growth
- On landscape functions associated with transport paths
- Fractal regularity results on optimal irrigation patterns
- On the Hölder regularity of the landscape function
- A Modica-Mortola approximation for branched transport and applications
- On the limited memory BFGS method for large scale optimization
- Optimal transportation networks. Models and theory
- A Modica-Mortola approximation for branched transport
- Functional analysis, Sobolev spaces and partial differential equations
- Convex analysis and measurable multifunctions
- A variational model of irrigation patterns
- Optimal channel networks, landscape function and branched transport
- Traffic plans
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Uniform estimates for a Modica–Mortola type approximation of branched transportation
- Updating Quasi-Newton Matrices with Limited Storage
- Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
- 11. On the Lagrangian branched transport model and the equivalence with its Eulerian formulation
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
- Approximation of Length Minimization Problems Among Compact Connected Sets
- Steiner Minimal Trees