Numerical Methods for Mean-Field-Type Optimal Control Problems
Not on the map. Why?
Abstract (arXiv)
In this article, two methods for solving mean-field type optimal control problems are proposed and investigated. The two methods are iterative methods: at each iteration, a Hamilton-Jacobi-Bellman equation is solved, for a terminal condition obtained by linearizing the cost function. The terminal condition is updated by solving a Fokker-Planck equation. The first method can be seen as a gradient method and uses in an essential manner the convexity of the set of probability distributions. A convergence result for this method is provided. The second method incorporates a penalization term and provides feedback controls. We test the methods on four academic examples.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Mar 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2021Concave Utility Reinforcement Learning: the Mean-Field Game Viewpointcited by 54
- 2022Mean-field neural networks-based algorithms for McKean-Vlasov control problems *cited by 9
- 2026Stochastic Control Methods for Optimizationcited by 1
- 2022Stability Via Adversarial Training of Neural Network Stochastic Control of Mean-Field Typecited by 0
- 2026Stochastic Control Methods for Optimization3 Jan 2026
- 2022Mean-field neural networks-based algorithms for McKean-Vlasov control problems *22 Dec 2022
- 2022Stability Via Adversarial Training of Neural Network Stochastic Control of Mean-Field Type27 Sep 2022
- 2021Concave Utility Reinforcement Learning: the Mean-Field Game Viewpoint7 Jun 2021