arXiv (All)
open access
Quantitative Mean-Field Limits for Recent Variants of Consensus-Based Optimization Optimization
Consensus-based optimization (CBO) is a robust and flexible zero-order, multi-particle class of methods devised to provide provable solutions to high-dimensional global optimization problems, including truly nonconvex and/or nonsmooth cases. The algorithmic framework is grounded in a principled trad
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
- An interacting particle consensus method for constrained global optimization#1117199
- ProxiCBO: A Provably Convergent Consensus-Based Method for Composite Optimization#1117365
- Consensus-based optimization for linearly separable functions#821265
- From Consensus-Based Optimization to Evolution Strategies: Proof of Global Convergence#1328383
- Regularity and positivity of solutions of the Consensus-Based Optimization equation: unconditional global convergence#1248245
Record · ID 1187579
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