一种求解提升分支输运问题的自适应有限元方法
An adaptive finite element approach for lifted branched transport problems
摘要:
我们认为所谓的分支运输及其变种在两个空间维度。在这些模型中,人们寻求一个最佳的运输网络,为一个给定的大众运输任务。在两个空间维度上,它们与Mumford-Shah型图像处理问题密切相关,而Mumford-Shah型图像处理问题又可以通过所谓的函数提升与某些高维凸优化问题相关。我们研究这些不同的模型之间的关系,并利用它来解决分支传输模型数值通过凸优化。为此,我们开发了一个有效的数值处理的基础上,专门设计的自适应有限元类。尽管凸优化问题的高维性和复杂的非局部约束,该方法允许精细解决的最优运输网络的计算。特别地,通过离散化的设计,约束的无限集减少到有限数量的不等式。
英文摘要:
We consider so-called branched transport and variants thereof in two space dimensions. In these models one seeks an optimal transportation network for a given mass transportation task. In two space dimensions, they are closely connected to Mumford--Shah-type image processing problems, which in turn can be related to certain higher-dimensional convex optimization problems via so-called functional lifting. We examine the relation between these different models and exploit it to solve the branched transport model numerically via convex optimization. To this end we develop an efficient numerical treatment based on a specifically designed class of adaptive finite elements. This method allows the computation of finely resolved optimal transportation networks despite the high dimensionality of the convex optimization problem and its complicated set of nonlocal constraints. In particular, by design of the discretization the infinite set of constraints reduces to a finite number of inequalities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。