Jump to content

Consensus based optimization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 20:52, 3 February 2024 (Alter: date, issue. Add: s2cid, arxiv, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Category:CS1 errors: dates | #UCB_Category 2/9). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Consensus based optimization (CBO) [1] is a method to obtain solutions for global optimization problems of the form where denotes the objective function acting on the state space . The algorithm is based on particles exploring the state space, while communicating with each other to update their positions. In this sense, CBO is comparable to wind driven optimization[2], particle swarm optimization or Simulated annealing. However, compared to other heuristics, CBO was designed to have a well-posed mean-field limit

Convergence

Variants

Polarization

See also

Particle Swarm Optimization



References

  1. ^ Pinnau, René; Totzeck, Claudia; Tse, Oliver; Martin, Stephan (January 2017). "A consensus-based model for global optimization and its mean-field limit". Mathematical Models and Methods in Applied Sciences. 27 (1): 183–204. arXiv:1604.05648. doi:10.1142/S0218202517400061. ISSN 0218-2025. S2CID 119296432.
  2. ^ "The Wind Driven Optimization Technique and its Application in Electromagnetics | IEEE Journals & Magazine | IEEE Xplore". ieeexplore.ieee.org. Retrieved 2024-02-03.