Semi-discrete optimal transport: hardness, regularization and numerical solution
From MaRDI portal
Publication:6038666
DOI10.1007/s10107-022-01856-xzbMath1518.90049arXiv2103.06263MaRDI QIDQ6038666
Daniel Kuhn, Soroosh Shafieezadeh-Abadeh, Bahar Taşkesen
Publication date: 2 May 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.06263
complexity; Wasserstein distance; discrete choice models; optimal transport; distributionally robust optimization; \(\#P\)-hardness; stochastic gradient descent algorithms
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90C17: Robustness in mathematical programming