English

Shape Optimization Problems for Metric Graphs

Optimization and Control 2019-02-20 v1 Combinatorics

Abstract

We consider the shape optimization problem min{E(Γ) : ΓA, H1(Γ)=l },\min\big\{{\mathcal E}(\Gamma)\ :\ \Gamma\in{\mathcal A},\ {\mathcal H}^1(\Gamma)=l\ \big\}, where H1{\mathcal H}^1 is the one-dimensional Hausdorff measure and A{\mathcal A} is an admissible class of one-dimensional sets connecting some prescribed set of points D={D1,,Dk}Rd{\mathcal D}=\{D_1,\dots,D_k\}\subset{\mathbb R}^d. The cost functional E(Γ){\mathcal E}(\Gamma) is the Dirichlet energy of Γ\Gamma defined through the Sobolev functions on Γ\Gamma vanishing on the points DiD_i. We analyze the existence of a solution in both the families of connected sets and of metric graphs. At the end, several explicit examples are discussed.

Keywords

Cite

@article{arxiv.1312.3909,
  title  = {Shape Optimization Problems for Metric Graphs},
  author = {Giuseppe Buttazzo and Berardo Ruffini and Bozhidar Velichkov},
  journal= {arXiv preprint arXiv:1312.3909},
  year   = {2019}
}

Comments

23 pages, 11 figures, ESAIM Control Optim. Calc. Var., (to appear)

R2 v1 2026-06-22T02:27:18.762Z