SOCP reformulation of staggered-grid dynamic optimal transport eliminates interpolation steps and enables efficient proximal augmented Lagrangian solving with demonstrated speed and robustness gains.
In: Gradient flows: from theory to application, ESAIM ProcS.54, 1–17 (2016)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
SOCP reformulation of staggered-grid dynamic optimal transport eliminates interpolation steps and enables efficient proximal augmented Lagrangian solving with demonstrated speed and robustness gains.