Algorithm for Hamilton-Jacobi equations in density space via a generalized Hopf formula
From MaRDI portal
Publication:2316263
DOI10.1007/S10915-019-00972-9zbMATH Open1422.91102arXiv1805.01636OpenAlexW2964104089MaRDI QIDQ2316263FDOQ2316263
Authors: Yat Tin Chow, Wuchen Li, Wotao Yin, Stanley Osher 
Publication date: 26 July 2019
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Abstract: We design fast numerical methods for Hamilton-Jacobi equations in density space (HJD), which arises in optimal transport and mean field games. We overcome the curse-of-infinite-dimensionality nature of HJD by proposing a generalized Hopf formula in density space. The formula transfers optimal control problems in density space, which are constrained minimizations supported on both spatial and time variables, to optimization problems over only spatial variables. This transformation allows us to compute HJD efficiently via multi-level approaches and coordinate descent methods.
Full work available at URL: https://arxiv.org/abs/1805.01636
Recommendations
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems
- Algorithm for overcoming the curse of dimensionality for certain non-convex Hamilton-Jacobi equations, projections and differential games
- An efficient algorithm for Hamilton-Jacobi equations in high dimension
- Algorithm for overcoming the curse of dimensionality for state-dependent Hamilton-Jacobi equations
- A splitting method for overcoming the curse of dimensionality in Hamilton-Jacobi equations arising from nonlinear optimal control and differential games with applications to trajectory generation
Differential games (aspects of game theory) (91A23) Applications of optimal control and differential games (49N90) Stochastic games, stochastic differential games (91A15)
Cites Work
- The geometry of optimal transportation
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Mean field games
- Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle
- Mean field games: convergence of a finite difference method
- Mean field games and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mean field games: numerical methods
- Potential games
- On general minimax theorems
- Iterative Bregman projections for regularized transportation problems
- Mean field games: numerical methods for the planning problem
- Augmented Lagrangian methods for transport optimization, mean field games and degenerate elliptic equations
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere
- Elementary proof for Sion's minimax theorem
- Entropy dissipation semi-discretization schemes for Fokker-Planck equations
- Hamilton-Jacobi equations in the Wasserstein space
- Existence of a solution to an equation arising from the theory of mean field games
- The Master Equation and the Convergence Problem in Mean Field Games
- Two numerical approaches to stationary mean-field games
- Optimal transport with convex obstacle
- Computations of optimal transport distance with Fisher information regularization
- Perspectives on characteristics based curse-of-dimensionality-free numerical approaches for solving Hamilton-Jacobi equations
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems
- Algorithm for overcoming the curse of dimensionality for certain non-convex Hamilton-Jacobi equations, projections and differential games
- Geodesics of minimal length in the set of probability measures on graphs
- Algorithm for overcoming the curse of dimensionality for state-dependent Hamilton-Jacobi equations
Cited In (12)
- Discrete potential mean field games: duality and numerical resolution
- Convergence analysis of machine learning algorithms for the numerical solution of mean field control and games. I: The ergodic case
- Value-Gradient Based Formulation of Optimal Control Problem and Machine Learning Algorithm
- A simple multiscale method for mean field games
- Semiglobal optimal feedback stabilization of autonomous systems via deep neural network approximation
- Optimal polynomial feedback laws for finite horizon control problems
- A game-theoretic framework for autonomous vehicles velocity control: bridging microscopic differential games and macroscopic mean field games
- Tracial smooth functions of non-commuting variables and the free Wasserstein manifold
- A mean field game inverse problem
- Consistent smooth approximation of feedback laws for infinite horizon control problems with non-smooth value functions
- Spectral methods for nonlinear functionals and functional differential equations
- Fourier approximation methods for first-order nonlocal mean-field games
This page was built for publication: Algorithm for Hamilton-Jacobi equations in density space via a generalized Hopf formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316263)
