希尔伯特空间中基于时间离散有限粒子共识的优化算法的收敛性
Convergence of time-discrete finite particle consensus based optimization in Hilbert spaces
浏览论文内容
中文总结 AI 辅助
该研究分析了希尔伯特空间中时间离散有限粒子CBO算法的收敛性，通过理论推导和数值实验验证其在空间分辨率提升时的稳定性能，补充了无限维下的相关结果。
中文摘要 AI 辅助
我们研究可分希尔伯特空间中的一种时间离散、有限粒子的基于共识的优化（Consensus-Based Optimization，CBO）算法。我们的分析直接为可计算的粒子系统提供了收敛性保证，补充了近期无限维下的连续时间和平均场结果。利用具有迹类协方差的公共噪声形式，我们首先建立了定量的成对收缩、群体期望方差的指数衰减，以及所有粒子几乎必然收敛到共同共识状态。随后，我们结合指数化目标函数的估计和定量拉普拉斯原理，表明对于足够大的逆温度和适当准备的初始数据，极限共识状态的能量可被控制得任意接近活动子空间上的全局最小值。希尔伯特空间形式的一个关键特征是，收敛估计中的随机贡献由协方差算子的迹控制，因此对Galerkin维度是均匀的。针对具有混合边界条件的椭圆能量最小化问题和偏微分方程约束的逆源问题的数值实验验证了理论收敛结果，并证明在空间分辨率提高时仍能保持稳定性能，这与基于各向同性有限维噪声的CBO形成对比。
英文摘要
We study a time-discrete, finite-particle Consensus-Based Optimization (CBO) algorithm in a separable Hilbert space. Our analysis provides convergence guarantees directly for the computable particle system, complementing recent continuous-time and mean-field results in infinite dimensions. Using a common-noise formulation with trace-class covariance, we first establish quantitative pairwise contraction, exponential decay of the expected swarm variance, and almost-sure convergence of all particles to a common consensus state. We then combine estimates on the exponentiated objective functional with a quantitative Laplace principle to show that, for sufficiently large inverse temperature and suitably prepared initial data, the energy of the limiting consensus state can be made arbitrarily close to the global minimum over the active subspace. A key feature of the Hilbert-space formulation is that the stochastic contribution to the convergence estimates is controlled by the trace of the covariance operator and is therefore uniform with respect to the Galerkin dimension. Numerical experiments on an elliptic energy minimization problem with mixed boundary conditions and a PDE-constrained inverse source problem validate the theoretical convergence results and demonstrate stable performance under increasing spatial resolution, in contrast with CBO based on isotropic finite-dimensional noise.
