A modified bat algorithm with conjugate gradient method for global optimization
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).
- A novel hybrid bat algorithm with harmony search for global numerical optimization
- A New Metaheuristic Bat-Inspired Algorithm
- A new improved bat algorithm for global optimization
- Multi-directional bat algorithm for solving unconstrained optimization problems
- A modified hybrid conjugate gradient method for unconstrained optimization
- A new conjugate gradient method for unconstrained optimization
- A new hybrid algorithm for convex nonlinear unconstrained optimization
- A New Metaheuristic Bat-Inspired Algorithm
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A spectral conjugate gradient method for unconstrained optimization
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Function minimization by conjugate gradients
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Numerical Optimization
- Two-Point Step Size Gradient Methods
- A method of two new augmented Lagrange multiplier versions for solving constrained problems
- scientific article; zbMATH DE number 6310506 (Why is no real title available?)
- A new modified bat algorithm for global optimization
- Multi-directional bat algorithm for solving unconstrained optimization problems
This page was built for publication: A modified bat algorithm with conjugate gradient method for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779965)
