Entropic Optimal Transport Problem with Convex Functional Cost

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Kazeykina, Anna, Ren, Zhenjie, Wang, Xiaozhen, Zhang, Yufei
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908707307126784
author Kazeykina, Anna
Ren, Zhenjie
Wang, Xiaozhen
Zhang, Yufei
author_facet Kazeykina, Anna
Ren, Zhenjie
Wang, Xiaozhen
Zhang, Yufei
contents We study an entropic optimal transport problem in which the transport plan is penalized by a nonlinear convex functional acting on the coupling. We establish existence, uniqueness, and uniform a priori bounds for minimizers, and we show that each minimizer satisfies a fixed-point first-order optimality system associated with an exponentially tilted reference measure. Building on this variational structure, we introduce the Sinkhorn-Frank-Wolfe (SFW) flow, prove its global well-posedness, and derive an energy-dissipation inequality yielding exponential convergence toward the unique optimal transport plan. As an application, we implement the SFW algorithm to solve an optimal routing problem for unmanned aerial vehicles with congestion aversion.
format Preprint
id arxiv_https___arxiv_org_abs_2503_11843
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Entropic Optimal Transport Problem with Convex Functional Cost
Kazeykina, Anna
Ren, Zhenjie
Wang, Xiaozhen
Zhang, Yufei
Optimization and Control
We study an entropic optimal transport problem in which the transport plan is penalized by a nonlinear convex functional acting on the coupling. We establish existence, uniqueness, and uniform a priori bounds for minimizers, and we show that each minimizer satisfies a fixed-point first-order optimality system associated with an exponentially tilted reference measure. Building on this variational structure, we introduce the Sinkhorn-Frank-Wolfe (SFW) flow, prove its global well-posedness, and derive an energy-dissipation inequality yielding exponential convergence toward the unique optimal transport plan. As an application, we implement the SFW algorithm to solve an optimal routing problem for unmanned aerial vehicles with congestion aversion.
title Entropic Optimal Transport Problem with Convex Functional Cost
topic Optimization and Control
url https://arxiv.org/abs/2503.11843