Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces
Abstract
Mean field planning on a surface prescribes initial and terminal densities and minimizes a transport energy subject to the continuity equation. Proximal algorithms for this problem repeatedly solve a time--space Poisson equation, whose temporal derivative and surface gradient determine the density and momentum corrections. We study a gradient-enhanced approximation of this constraint projection using finite differences in time, surface finite elements in space, temporal polynomial preserving recovery, and spatial parametric polynomial preserving recovery. The same construction is incorporated into ISTA, FISTA, and Douglas--Rachford splitting. We distinguish the recovered update from an exact discrete projection and derive residual identities and conditional finite-iteration perturbation bounds that retain data, boundary, and linear-solver errors. Existing derivative-recovery estimates identify a higher-order contribution under suitable regularity and mesh assumptions; they do not by themselves establish convergence of the outer optimization iteration. Available numerical illustrations on the sphere and a more complicated algebraic surface are discussed together with the limits of the recorded refinement data.
Related
- Wasserstein accelerated proximal gradient algorithms
- Asymptotic Analysis of Gradient Mapping-type Stationarity Measure for the Sum of Nonconvex Nonsmooth Functions and Applications to Proximal Gradient-type Algorithms
- Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
- EQUIVARIANCE VERSUS FIRM NON-EXPANSIVENESS IN INCREMENTAL PROXIMAL GRADIENT METHODS FOR PLUG-AND-PLAY DENOISING
- On The Linear Convergence of Bregman Proximal Gradient Methods with Applications to Kullback--Leibler regression
BibTeX
@misc{jiang2026gradientenhanced,
title = {{Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces}},
author = {Chengrun Jiang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.10370},
eprint = {2609.10370},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.10370},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces
AU - Chengrun Jiang
PY - 2026
DA - 2026/09/09
PB - arXiv
DO - 10.48550/arxiv.2609.10370
UR - https://arxiv.org/abs/2609.10370
AB - Mean field planning on a surface prescribes initial and terminal densities and minimizes a transport energy subject to the continuity equation. Proximal algorithms for this problem repeatedly solve a time--space Poisson equation, whose temporal derivative and surface gradient determine the density and momentum corrections. We study a gradient-enhanced approximation of this constraint projection using finite differences in time, surface finite elements in space, temporal polynomial preserving recovery, and spatial parametric polynomial preserving recovery. The same construction is incorporated into ISTA, FISTA, and Douglas--Rachford splitting. We distinguish the recovered update from an exact discrete projection and derive residual identities and conditional finite-iteration perturbation bounds that retain data, boundary, and linear-solver errors. Existing derivative-recovery estimates identify a higher-order contribution under suitable regularity and mesh assumptions; they do not by themselves establish convergence of the outer optimization iteration. Available numerical illustrations on the sphere and a more complicated algebraic surface are discussed together with the limits of the recorded refinement data.
ER -