1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.NA2026
Newton's method for optimal transport problem on graphs
Qujiangxue Chen, Jianbo Cui, Luca Dieci +1
In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and veloc…
math.OC2025
Computing Optimal Trajectories for Optimal Transport in Nonuniform Environments
Luca Dieci, Daniyar Omarov
In this work, we solve a discrete optimal transport problem in a nonuniform environment. To solve the optimal transport problem, we build the cost matrix and then use classical sol…
math.DS1998★ 1 cited
An efficient algorithm for locating and continuing connecting orbits
J. W. Demmel, L. Dieci, M. J. Friedman
A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [9]. In this paper we present an improved algorithm for…