Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Barrier relaxations of the classical and quantum optimal transport problems (2505.10667v1)

Published 15 May 2025 in math.OC, math-ph, and math.MP

Abstract: In the last fifteen years a significant progress was achieved by considering an entropic relaxation of the classical multi-partite optimal transport problem (MPOTP). The entropic relaxation gives rise to the rescaling problem of a given tensor. This rescaling can be achieved fast with the Sinkhorn type algorithms. Recently, it was shown that a similar approach works for the quantum MPOTP. However, the analog of the rescaling Sinkhorn algorithm is much more complicated than in the classical MPOTP. In this paper we show that the interior point method (IPM) for the primary and dual problems of classical and quantum MPOTP problems can be considered as barrier relaxations of the optimal transport problems (OTP). It is well known that the dual of the OTP are advantageous as it has much less variables than the primary problem. The IPM for the dual problem of the classical MPOTP are not as fast as the Sinkhorn type algorithm. However, IPM method for the dual of the quantum MPOTP seems to work quite efficiently.

Summary

We haven't generated a summary for this paper yet.