arXiv · 1808.10154
Convergence of dynamic programming principles for the $p$-Laplacian
Abstract
We provide a unified strategy to show that solutions of dynamic programming principles associated to the $p$-Laplacian converge to the solution of the corresponding Dirichlet problem. Our approach includes all previously known cases for continuous and discrete dynamic programming principles, provides new results, and gives a convergence proof free of probability arguments.
Explore related subjects
Keep this discovery
Félix del Teso, Juan J. Manfredi, Mikko Parviainen. 2018-08-30. Convergence of dynamic programming principles for the $p$-Laplacian. https://arxiv.org/abs/1808.10154
Cite the original work for its findings. Save a collection to share your selection of sources.