1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.OC2023
Algorithms for Euclidean-regularised Optimal Transport
Dmitry A. Pasechnyuk, Michael Persiianov, Pavel Dvurechensky +1
This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean -norm. It offers theoretical guarantees regarding the iteration complexi…
math.OC2023★ 1 cited
Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem
Evgenia Gasnikova, Alexander Gasnikov, Demyan Yarmoshik +7
In this paper we consider multi-stages traffic assignment with several demand layers, user types and network types. We consider two stages: demand matrix calculation (Entropy Wilso…