Full history recursive multilevel Picard approximations suffer from the curse of dimensionality for the Hamilton-Jacobi-Bellman equation of a stochastic control problem

Documenti analoghi

• Multilevel Picard approximations overcome the curse of dimensionality when approximating semilinear heat equations with gradient-dependent nonlinearities in $L^p$-sense
  di: Nguyen, Tuan Anh
  Pubblicazione: (2024)
• Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities
  di: Neufeld, Ariel, et al.
  Pubblicazione: (2023)
• Rectified deep neural networks overcome the curse of dimensionality when approximating solutions of McKean--Vlasov stochastic differential equations
  di: Neufeld, Ariel, et al.
  Pubblicazione: (2023)
• Rectified deep neural networks overcome the curse of dimensionality in the numerical approximation of gradient-dependent semilinear heat equations
  di: Neufeld, Ariel, et al.
  Pubblicazione: (2024)
• Multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation overcome the curse of dimensionality when approximating semilinear parabolic partial differential equations in $L^p$-sense
  di: Neufeld, Ariel, et al.
  Pubblicazione: (2024)