Pith. sign in

REVIEW 1 cited by

Constrained dynamical optimal transport and its Lagrangian formulation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.00937 v2 pith:FZ233ULN submitted 2018-07-03 math.OC

Constrained dynamical optimal transport and its Lagrangian formulation

Wuchen Li , Stanley Osher This is my paper
classification math.OC
keywords constraineddynamicalformulationoptimalparameterizedprobabilityproblemstransport
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose dynamical optimal transport (OT) problems constrained in a parameterized probability subset. In application problems such as deep learning, the probability distribution is often generated by a parameterized mapping function. In this case, we derive a simple formulation for the constrained dynamical OT.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Convex Relaxations for the Optimization of Markov Processes

    math.OC 2026-07 conditional novelty 6.0

    Sequential-coupling convex relaxations using local marginals and cluster moments solve high-dimensional Markov process optimization, recovering Benamou–Brenier dynamics and general kernels as special cases.