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žené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 199; číslo 1-2; s. 1107 - 1178
Hlavní autori:	Altschuler, Jason M., Boix-Adserà, Enric
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2023 Springer
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!