Bibliographic Details
| Title: |
A fast proximal gradient method and convergence analysis for dynamic mean field planning. |
| Authors: |
Yu, Jiajia1 (AUTHOR), Lai, Rongjie2 (AUTHOR), Li, Wuchen3 (AUTHOR), Osher, Stanley4 (AUTHOR) |
| Superior Title: |
Mathematics of Computation. Mar2024, Vol. 93 Issue 346, p603-642. 40p. |
| Subject Terms: |
*ELLIPTIC equations, *MEAN field theory, *CONJUGATE gradient methods, *ALGORITHMS |
| Abstract: |
In this paper, we propose an efficient and flexible algorithm to solve dynamic mean-field planning problems based on an accelerated proximal gradient method. Besides an easy-to-implement gradient descent step in this algorithm, a crucial projection step becomes solving an elliptic equation whose solution can be obtained by conventional methods efficiently. By induction on iterations used in the algorithm, we theoretically show that the proposed discrete solution converges to the underlying continuous solution as the grid becomes finer. Furthermore, we generalize our algorithm to mean-field game problems and accelerate it using multilevel and multigrid strategies. We conduct comprehensive numerical experiments to confirm the convergence analysis of the proposed algorithm, to show its efficiency and mass preservation property by comparing it with state-of-the-art methods, and to illustrate its flexibility for handling various mean-field variational problems. [ABSTRACT FROM AUTHOR] |
|
Copyright of Mathematics of Computation is the property of American Mathematical Society and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |
