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.
Main Authors
Format
Articles Research article
Published
2022
Series
Subjects
Publication in research information system
Publisher
De Gruyter
The permanent address of the publication
https://urn.fi/URN:NBN:fi:jyu-202004172791Käytä tätä linkitykseen.
Review status
Peer reviewed
ISSN
1864-8258
DOI
https://doi.org/10.1515/acv-2019-0043
Language
English
Published in
Advances in Calculus of Variations
Citation
  • del Teso, F., Manfredi, J. J., & Parviainen, M. (2022). Convergence of dynamic programming principles for the p-Laplacian. Advances in Calculus of Variations, 15(2), 191-212. https://doi.org/10.1515/acv-2019-0043
License
In CopyrightOpen Access
Funder(s)
Research Council of Finland
Funding program(s)
Academy Project, AoF
Akatemiahanke, SA
Research Council of Finland
Additional information about funding
The first author is supported by the Toppforsk (research excellence) project Waves and Nonlinear Phenomena (WaNP), grant no. 250070 from the Research Council of Norway, and by the grant PGC2018-094522-B-I00 from the MICINN of the Spanish Government. The third author is supported by the Academy of Finland project no. 298641.
Copyright© 2020 Walter de Gruyter GmbH, Berlin/Boston

Share