arXiv (All)
open access
On the convergence rates of generalized conditional gradient method for fully discretized Mean Field Games
We study convergence rates of the generalized conditional gradient (GCG) method applied to fully discretized Mean Field Games (MFG) systems. While explicit convergence rates of the GCG method have been established at the continuous PDE level, a rigorous analysis that simultaneously accounts for time
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Sample-Wise Adjoint Regression Framework for Mean-Field Control with Connections to Adjoint Matching#793627
- A Sample-Wise Adjoint Regression Framework for Mean-Field Control with Connections to Adjoint Matching#789623
- Heterogeneous mean-field systems#7839
- Discretization in covariate-adaptive randomization: gains and losses#998580
- A Non-Antagonistic Stability Theorem for Scientific Frameworks#79993
Record · ID 1386996
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive