mlsanityData to 14 Oct 2026

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems

arXiv 2407.06481 ↗First posted 9 Jul 2024math.OC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In this note, we generalize the classical optimal partial transport (OPT) problem by modifying the mass destruction/creation term to function-based terms, introducing what we term ``generalized optimal partial transport'' problems. We then discuss the dual formulation of these problems and the associated Sinkhorn solver. Finally, we explore how these new OPT problems relate to classical optimal transport (OT) problems and introduce a linear programming solver tailored for these generalized scenarios.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 13 references that are in the map. First posted on arXiv 9 Jul 2024.

Builds on

1 of 13 references.

References · 1

  1. 2022Sliced Optimal Partial Transportcited by 20

Built on by

Not cited yet.