Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Cooperative Multi-Simplex Algorithm: An Innovation from Localization to Globalization

Version 1 : Received: 12 April 2020 / Approved: 16 April 2020 / Online: 16 April 2020 (12:54:15 CEST)

How to cite: Ali, J. Cooperative Multi-Simplex Algorithm: An Innovation from Localization to Globalization. Preprints 2020, 2020040273 (doi: 10.20944/preprints202004.0273.v1). Ali, J. Cooperative Multi-Simplex Algorithm: An Innovation from Localization to Globalization. Preprints 2020, 2020040273 (doi: 10.20944/preprints202004.0273.v1).

Abstract

This study suggests a novel cooperative multi-simplex algorithm that generalizes a local search optimizer to design a novel global search heuristic algorithm. The proposed algorithm exploits the vertex sharing strategy to enhance the search abilities of the working simplexes. The vertex sharing among the simplexes is carried out through cooperative step that is based on fitness of the underlying simplex. The proposed algorithm is applied to solve some systems of nonlinear equations by transforming them to optimization problems. Comparative analysis of results shows that the proposed method is practical and effective.

Subject Areas

Nelder-Mead algorithm; cooperative multi-simplex algorithm; simplex-fitness; system of nonlinear equations

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.