arXiv (All)
open access
Geometric flows of branched transportation networks
The branched transport problem is a nonconvex and nonsmooth variational optimization problem on normal $1$-currents in $\mathbb{R}^n$ with prescribed boundary. The optimality is with respect to some non-decreasing, lower semicontinuous, and subadditive function $τ:\mathbb{R}_+\to\mathbb{R}_+$ with $
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation#418070
- Geometry and Convergence of Quadratically Regularized Optimal Transport II#1157425
- Optimal Transport and Ricci Flow / Marco Flaim ; Gutachter: Alexander Lytchak ; Betreuer: Karl-Theodor Sturm#1154206
- Entropic optimal transport beyond product reference couplings: the Gaussian case on Euclidean space#128427
- Bilevel Optimization of the Kantorovich Problem and its Quadratic Regularization Part III: The Finite-Dimensional Case#1062628
Record · ID 1050627
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive