Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Consensus-based global optimization with personal best

Tools
- Tools
+ Tools

Totzeck, Claudia and Wolfram, Marie-Therese (2020) Consensus-based global optimization with personal best. Mathematical Biosciences and Engineering, 17 (5). pp. 6026-6044. doi:10.3934/mbe.2020320 ISSN 1547-1063.

[img]
Preview
PDF
WRAP-Consensus-based-global-optimization-personal-best-Wolfram-2020.pdf - Published Version - Requires a PDF viewer.
Available under License Creative Commons Attribution 4.0.

Download (2003Kb) | Preview
[img] PDF
WRAP-Consensus-based-global-optimization-personal-best-Wolfram-2020.pdf - Accepted Version
Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer.

Download (2245Kb)
Official URL: https://doi.org/10.3934/mbe.2020320

Request Changes to record.

Abstract

In this paper we propose a variant of a consensus-based global optimization (CBO) method that uses personal best information in order to compute the global minimum of a non-convex, locally Lipschitz continuous function. The proposed approach is motivated by the original particle swarming algorithms, in which particles adjust their position with respect to the personal best, the current global best, and some additive noise. The personal best information along an individual trajectory is included with the help of a weighted mean. This weighted mean can be computed very efficiently due to its ac-cumulative structure. It enters the dynamics via an additional drift term. We illustrate the performance with a toy example, analyze the respective memory-dependent stochastic system and compare the per-formance with the original CBO with component-wise noise for several benchmark problems. The proposed method has a higher success rate for computational experiments with a small particle number and where the initial particle distribution is disadvantageous with respect to the global minimum.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH): Nonconvex programming, Mathematical optimization, Stochastic processes, Biomathematics
Journal or Publication Title: Mathematical Biosciences and Engineering
Publisher: American Institute of Mathematical Sciences (A I M S Press)
ISSN: 1547-1063
Official Date: 11 September 2020
Dates:
DateEvent
11 September 2020Published
17 August 2020Accepted
Volume: 17
Number: 5
Page Range: pp. 6026-6044
DOI: 10.3934/mbe.2020320
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access (Creative Commons)
Date of first compliant deposit: 9 September 2020
Date of first compliant Open Access: 24 November 2020
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
UNSPECIFIEDEuropean Social Fundhttp://dx.doi.org/10.13039/501100004895
UNSPECIFIEDBaden-Württemberg (Germany). Ministerium für Wissenschaft, Forschung und Kunsthttp://viaf.org/viaf/154059761
NST-0001Österreichischen Akademie der WissenschaftenUNSPECIFIED
Related URLs:
  • Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us