arXiv Open Access 2023

Polynomial-Time Solvers for the Discrete $\infty$-Optimal Transport Problems

Meyer Scetbon

Lihat Sumber

Abstrak

In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\infty$-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that efficient numerical methods for these problems have been proposed.

Topik & Kata Kunci

math.OC cs.LG

Penulis (1)

Meyer Scetbon

Format Sitasi

APA MLA BibTeX

Scetbon, M. (2023). Polynomial-Time Solvers for the Discrete $\infty$-Optimal Transport Problems. https://arxiv.org/abs/2304.13467

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2023
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓