mlsanityData to 7 Oct 2026

Trends in Consensus-based optimization

arXiv 2104.01383 ↗First posted 3 Apr 2021math.OCcited by 8

Not on the map. Why?

Abstract (arXiv)

In this chapter we give an overview of the consensus-based global optimization algorithm and its recent variants. We recall the formulation and analytical results of the original model, then we discuss variants using component-wise independent or common noise. In combination with mini-batch approaches those variants were tailored for machine learning applications. Moreover, it turns out that the analytical estimates are dimension independent, which is useful for high-dimensional problems. We discuss the relationship of consensus-based optimization with particle swarm optimization, a method widely used in the engineering community. Then we survey a variant of consensus-based optimization that is proposed for global optimization problems constrained to hyper-surfaces. We conclude the chapter with remarks on applications, preprints and open problems.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Apr 2021.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 4; 2023: 2; 2024: 2.

8 papers.