Duality in branched transport and urban planning

DOI10.1007/S00245-022-09927-3MaRDI QIDQ2084533zbMATH OpenOpenAlexFDO

Authors Julius Lohmann, Bernhard Schmitzer, Benedikt Wirth

Publication date 18 October 2022

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2205.12049

zbMATH Keywords

branched transportFenchel dualitygeometric measure theoryoptimal transportrectifiable networksurban planningWasserstein distance

Mathematics Subject Classification ID

Optimization of shapes other than minimal surfaces (49Q10) Optimal transportation (49Q22)

Abstract: In recent work arXiv:2109.07820 we have shown the equivalence of the widely used nonconvex (generalized) branched transport problem with a shape optimization problem of a street or railroad network, known as (generalized) urban planning problem. The argument was solely based on an explicit construction and characterization of competitors. In the current article we instead analyse the dual perspective associated with both problems. In more detail, the shape optimization problem involves the Wasserstein distance between two measures with respect to a metric depending on the street network. We show a Kantorovich$unicodex2013$Rubinstein formula for Wasserstein distances on such street networks under mild assumptions. Further, we provide a Beckmann formulation for such Wasserstein distances under assumptions which generalize our previous result in arXiv:2109.07820. As an application we then give an alternative, duality-based proof of the equivalence of both problems under a growth condition on the transportation cost, which reveals that urban planning and branched transport can both be viewed as two bilinearly coupled convex optimization problems.

Recommendations

• Formulation of branched transport as geometry optimization
• Equivalent formulations for the branched transport and urban planning problems
• Optimal networks for mass transportation problems
• An equivalent path functional formulation of branched transportation problems
• Optimization problems in the theory of mass transportation

Cites work

• Calculus of variations
• Convex analysis and measurable multifunctions
• Convex functions. Constructions, characterizations and counterexamples
• Dynamic models of Wasserstein-1-type unbalanced transport
• Equivalent formulations for the branched transport and urban planning problems
• Formulation of branched transport as geometry optimization
• General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
• Gradient flows in metric spaces and in the space of probability measures
• scientific article; zbMATH DE number 4218149 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 1448982 (Why is no real title available?)
• scientific article; zbMATH DE number 3280853 (Why is no real title available?)
• scientific article; zbMATH DE number 3280855 (Why is no real title available?)
• Maß- und Integrationstheorie
• On the Kantorovich-Rubinstein theorem
• Optimal networks for mass transportation problems
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
• Optimal Transport
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• Optimal transportation networks. Models and theory
• Optimal urban networks via mass transportation

Cited in

(4)

• Formulation of branched transport as geometry optimization
• Equivalent formulations for the branched transport and urban planning problems
• Sparsity for dynamic inverse problems on Wasserstein curves with bounded variation
• Optimal quantization with branched optimal transport distances

This page was built for publication: Duality in branched transport and urban planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084533)