A modified bat algorithm with conjugate gradient method for global optimization
type: Item
instance of: scholarly article
title: A modified bat algorithm with conjugate gradient method for global optimization
zbMATH Open document ID: 1487.90601
DOI: 10.1155/2020/4795793
author: Huda I. Ahmed
author: Eman T. Hamed
author: Hamsa Th. Saeed Chilmeran
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 2020-07-14T00:00:00Z
review text: Summary: Metaheuristic algorithms are used to solve many optimization problems. Firefly algorithm, particle swarm improvement, harmonic search, and bat algorithm are used as search algorithms to find the optimal solution to the problem field. In this paper, we have investigated and analyzed a new scaled conjugate gradient algorithm and its implementation, based on the exact Wolfe line search conditions and the restart Powell criterion. The new spectral conjugate gradient algorithm is a modification of the Birgin and Martínez method, a manner to overcome the lack of positive definiteness of the matrix defining the search direction. The preliminary computational results for a set of 30 unconstrained optimization test problems show that this new spectral conjugate gradient outperforms a standard conjugate gradient in this field and we have applied the newly proposed spectral conjugate gradient algorithm in bat algorithm to reach the lowest possible goal of bat algorithm. The newly proposed approach, namely, the directional bat algorithm (CG-BAT), has been then tested using several standard and nonstandard benchmarks from the CEC'2005 benchmark suite with five other algorithms and has been then tested using nonparametric statistical tests and the statistical test results show the superiority of the directional bat algorithm, and also we have adopted the performance profiles given by Dolan and More which show the superiority of the new algorithm (CG-BAT).
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 7220370
zbMATH Keywords: metaheuristic algorithms
zbMATH Keywords: optimization problems
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2020/4795793
OpenAlex ID: W3034017116
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
cites work: Methods of conjugate gradients for solving linear systems
cites work: Q5563083
cites work: Function minimization by conjugate gradients
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
cites work: Q3563491
cites work: Numerical Optimization
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: A spectral conjugate gradient method for unconstrained optimization
cites work: Two-Point Step Size Gradient Methods
cites work: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
cites work: A new hybrid algorithm for convex nonlinear unconstrained optimization
cites work: A New Metaheuristic Bat-Inspired Algorithm
cites work: Q3539529
cites work: Benchmarking optimization software with performance profiles.
description: scientific article; zbMATH DE number 7220370