Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces

DOI10.48550/arXiv.2609.10370MaRDI QIDQ7288218arXivFDO

Authors Chengrun Jiang

Publication date 9 September 2026

Published in arXiv

Tldr We introduce gradient-enhanced proximal algorithms for mean field planning using finite differences in time and surface finite elements in space, incorporating temporal polynomial preserving recovery and spatial parametric polynomial preserving recovery; we derive residual identities and conditional perturbation bounds for these approximations.

Full work available at URL https://doi.org/10.48550/arXiv.2609.10370

arXiv classification

math.NA

Cites work

• A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A fast proximal gradient method and convergence analysis for dynamic mean field planning
• A New Finite Element Gradient Recovery Method: Superconvergence Property
• A Posteriori Error Estimates Based on the Polynomial Preserving Recovery
• A variational approach to the mean field planning problem
• Adaptive restart for accelerated gradient schemes
• An Adaptive Finite Element Method for the Laplace–Beltrami Operator on Implicitly Defined Surfaces
• Augmented Lagrangian methods for transport optimization, mean field games and degenerate elliptic equations
• Computational Mean-field Games on Manifolds
• Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
• Dynamical Optimal Transport on Discrete Surfaces
• Dynamical Optimal Transport on Discrete Surfaces
• Finite element methods for surface PDEs
• Gradient enhanced ADMM Algorithm for dynamic optimal transport on surfaces
• Higher-order finite element methods and pointwise error estimates for elliptic problems on surfaces
• Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle
• Mean field games
• Mean field games systems of first order
• Mean field games: convergence of a finite difference method
• Mean field games: numerical methods
• Mean field games: numerical methods for the planning problem
• On the implementation of a primal-dual algorithm for second order time-dependent mean field games with local couplings
• On the planning problem for the mean field games system
• Optimal transport with proximal splitting
• Parameter-free FISTA by adaptive restart and backtracking
• Parametric polynomial preserving recovery on manifolds
• Polar factorization of maps on Riemannian manifolds
• Proximal methods for stationary mean field games with local couplings
• Proximité et dualité dans un espace hilbertien
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Superconvergence and Gradient Recovery of Linear Finite Elements for the Laplace–Beltrami Operator on General Surfaces
• The superconvergent patch recovery anda posteriori error estimates. Part 1: The recovery technique
• Unconditional convergence for discretizations of dynamical optimal transport

This page was built for publication: Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288218)