Simplex Search Based Brain Storm Optimization
Wei Chen, YingYing Cao, Shi Cheng, Yifei Sun, Qunfeng Liu, and Yun Li

TL;DR
This paper introduces Simplex-BSO, a hybrid algorithm combining Brain Storm Optimization with Nelder-Mead Simplex to improve convergence and accuracy in global optimization tasks.
Contribution
It proposes a novel hybrid approach that balances exploration and exploitation, effectively addressing the degenerated L-curve phenomenon in BSO.
Findings
Eliminates the L-curve phenomenon on unimodal functions.
Significantly alleviates the L-curve issue on multimodal functions.
Demonstrates promising results in global optimization experiments.
Abstract
Through modeling human's brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population-based evolutionary algorithm. However, BSO is pointed out that it possesses a degenerated L-curve phenomenon, i.e., it often gets near optimum quickly but needs much more cost to improve the accuracy. To overcome this question in this paper, an excellent direct search based local solver, the Nelder-Mead Simplex (NMS) method is adopted in BSO. Through combining BSO's exploration ability and NMS's exploitation ability together, a simplex search based BSO (Simplex-BSO) is developed via a better balance between global exploration and local exploitation. Simplex-BSO is shown to be able to eliminate the degenerated L-curve phenomenon on unimodal functions, and alleviate significantly this phenomenon on multimodal functions. Large number of experimental results show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research · Neural Networks and Applications · Evolutionary Algorithms and Applications
