Fixed point computing based on fireworks algorithms
Abstract
Fixed point theory is of importance in calculus equation, operational research, program analysis and mathematical economics. The calculation of fixed point is the core of fixed point theory, and it is a difficult problem. In this paper, the fixed point problem is transformed into an optimization problem, and the fireworks algorithm is used to solve the optimization problem. Experiments show that the algorithm is feasible, but the convergence speed and accuracy of the algorithm decrease when solving complex problems and the algorithm is easy to fall into local optimal solution. For this reason, adjusting the explosion amplitude of fireworks algorithm, it shows that the adjusted algorithm can greatly improve the convergence speed and accuracy, and effectively solve the local convergence problem.
Copyright © 2021 Huiwen Xiong, Yuqiang Feng, Zongna Deng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
H. Xiong, Y. Feng, Z. Deng, Fixed point computing based on fireworks algorithms, Adv. Fixed Point Theory 11 (2021), 9. https://doi.org/10.28919/afpt/5681
BibTeX
@article{Xiong2021,
author = {Xiong, Huiwen and Feng, Yuqiang and Deng, Zongna},
title = {Fixed point computing based on fireworks algorithms},
journal = {Adv. Fixed Point Theory},
volume = {11},
year = {2021},
pages = {9},
doi = {10.28919/afpt/5681}
}