1. What is the problem in the paper?
The first difficulty which this paper had to deal with isDynamic Programming for Mean-Field Type Control 19the extension of the HJB dynamic programming approach.
read more
2. how long does u have to be a conjugate-gradient algorithm?
As long as 4βert µ−Qt > 0 it leads toQt Qt −4βert µ = γe(T−t)µ γ−4β µ ⇒ Pt =4β µγe(T−t)µγe(T−t)µ − γ +4β µ . (43)Then, u is found by (36).
read more
3. What is the simplest way to solve the non-linear PDE?
To solve this non-linear PDE the authors use the fact that it is embedded into an iterative loop in Algorithm 1, and semi-linearise it by evaluating the square term in the last integral as a product of the same, where one factor is evaluated at the previous iteration.
read more
4. What is the way to reduce the cost functions?
If u0 = ue, then the algorithm decreases the cost functions by introducing small oscillations, a strategy which is clearly mesh dependent.
read more




