Dynamic programming in probability spaces via optimal transport
From MaRDI portal
Publication:6490242
DOI10.1137/23M1560902MaRDI QIDQ6490242
Nicolas Lanzetti, Antonio Terpin, Florian Dörfler
Publication date: 23 April 2024
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the relation between optimal transport and Schrödinger bridges: a stochastic control viewpoint
- Mass transportation with LQ cost functions
- Necessary optimality conditions for optimal control problems in Wasserstein spaces
- The Pontryagin Maximum Principle in the Wasserstein space
- Finite-horizon covariance control for discrete-time stochastic linear systems subject to input constraints
- Constrained minimum variance control for discrete-time stochastic linear systems
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Combinatorics. A problem based approach
- Approximate Wasserstein attraction flows for dynamic mass transport over networks
- Attainability property for a probabilistic target in Wasserstein spaces
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Dissipative probability vector fields and generation of evolution semigroups in Wasserstein spaces
- Optimal Steering of a Linear Stochastic System to a Final Probability Distribution, Part I
- Optimal Steering of a Linear Stochastic System to a Final Probability Distribution, Part II
- Barycenters in the Wasserstein Space
- Multi-marginal optimal transport: Theory and applications
- Robust Transport Over Networks
- Efficient Robust Routing for Single Commodity Network Flows
- Optimal Steering of a Linear Stochastic System to a Final Probability Distribution—Part III
- Relaxed Schrödinger Bridges and Robust Network Routing
- A Pontryagin Maximum Principle in Wasserstein spaces for constrained optimal control problems
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Existence, Uniqueness, and Regularity of Optimal Transport Maps
- A General Condition for Monge Solutions in the Multi-Marginal Optimal Transport Problem
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- Assign and Appraise: Achieving Optimal Performance in Collaborative Teams
- Discrete Optimal Transport with Independent Marginals is #P-Hard
This page was built for publication: Dynamic programming in probability spaces via optimal transport
