Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stochastic optimal transport with free end time (1909.04814v1)

Published 11 Sep 2019 in math.OC and math.AP

Abstract: We consider a stochastic transportation problem between two prescribed probability distributions (a source and a target) over processes with general drift dependence and with free end times. First, and in order to establish a dual principle, we associate two equivalent formulations of the primal problem in order to guarantee its convexity and lower semi-continuity with respect to the source and target distributions. We exhibit an equivalent Eulerian formulation, whose dual variational principle is given by Hamilton-Jacobi-BeLLMan type variational inequalities. In the case where the dependence on the drift is bounded, regularity results on the minimizers of the Eulerian problem then enable us to prove attainment in the corresponding dual problem. We also address attainment when the drift component of the cost defining Lagrangian $L$ is superlinear $L \approx |u|p$ with $1<p<2$, in which case the setting is reminiscent of our approach -- in a previous work -- on deterministic controlled transport problems with free end time. We finally address criteria under which the optimal drift and stopping time are unique, namely strict convexity in the drift component and monotonicity in time of the Lagrangian.

Summary

We haven't generated a summary for this paper yet.