# Sinkhorn algorithms and linear programming solvers for optimal partial transport problems

arXiv: https://arxiv.org/abs/2407.06481 · HTML: https://mlsanity.com/paper/2407.06481/

## 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 (most cited first, 1 of 1)

- [Sliced Optimal Partial Transport](https://mlsanity.com/paper/2212.08049/) (2022)

## 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.