Polynomial-time algorithms for multimarginal optimal transport problems with structure

Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences. However, in most applications, the success of MOT is severely limited by a lack of efficient algorithms. Indeed, MOT in general requires exponential time in...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 199; číslo 1-2; s. 1107 - 1178
Hlavní autoři:	Altschuler, Jason M., Boix-Adserà, Enric
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2023 Springer
Témata:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Machine learning Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical Implicit linear programming 90C06 Polynomial-time algorithms Structured linear programs Multimarginal optimal transport 90C08
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!