arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.02826math.FA
收藏

关于矩阵Monge-Kantorovich问题

On the Matrix Monge-Kantorovich Problem

Yongxin Chen, Wilfrid Gangbo, Tryphon T. Georgiou, Allen Tannenbaum

摘要:

经典的Monge-Kantorovich(MK)问题,最初提出的是关于如何最好地移动一堆土或碎石的挖掘或填充与一些费用函数的工作量最少。当成本由欧几里德距离的平方给出时,可以定义一个称为“瓦瑟斯坦距离”的密度度量。“在这篇笔记中,我们制定了一个自然矩阵对应的MK问题的正定密度矩阵。我们证明了一些结果,这个度量,包括表明,它可以制定为一个凸优化问题,强对偶,类似的Poincare-Wirtinger不等式,和一个Lax-Hopf-Oleinik型结果。

英文摘要:

The classical Monge-Kantorovich (MK) problem as originally posed is concerned with how best to move a pile of soil or rubble to an excavation or fill with the least amount of work relative to some cost function. When the cost is given by the square of the Euclidean distance, one can define a metric on densities called the "Wasserstein distance." In this note, we formulate a natural matrix counterpart of the MK problem for positive definite density matrices. We prove a number of results about this metric including showing that it can be formulated as a convex optimization problem, strong duality, an analogue of the Poincare-Wirtinger inequality, and a Lax-Hopf-Oleinik type result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑