|
|
 |
| |
|
|
|
Solving Linear Least Squares Problems Based on Improved Cuckoo Search Algorithm |
|
|
|
PP: 199-202 |
|
|
|
doi:10.18576/msl/050214
|
|
|
|
Author(s) |
|
|
|
Mohamed Abdel-Baset,
Ibrahim M. Hezam,
|
|
|
|
Abstract |
|
|
| In This paper, we propose a new algorithm that encompasses the features of cuckoo search and Newton method. It combines the fast convergence and the global search of the Cuckoo Search (CS), and the strong local search ability of Newton method (NM). The Compound Algorithm (CSNM) will be used to solve linear least squares problem. The linear least squares problem is transformed into an optimization problem, where the fitness function is defined as the sum of squared residuals. The proposed algorithm retained the global search capability with more accurate and faster convergence. The experimental results show that the proposed algorithm proved to be superior in convergence efficiency and computational accuracy. |
|
|
|
|
|
|
|
