Novel global harmony search algorithm for least absolute deviation (Q2336607)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7131755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Novel global harmony search algorithm for least absolute deviation |
scientific article; zbMATH DE number 7131755 |
Statements
Novel global harmony search algorithm for least absolute deviation (English)
0 references
19 November 2019
0 references
Summary: The method of least absolute deviation (LAD) finds applications in many areas, due to its robustness compared to the least squares regression (LSR) method. LAD is robust in that it is resistant to outliers in the data. This may be helpful in studies where outliers may be ignored. Since LAD is nonsmooth optimization problem, this paper proposed a metaheuristics algorithm named novel global harmony search (NGHS) for solving. Numerical results show that the NGHS method has good convergence property and effective in solving LAD.
0 references
0 references
0.7369300127029419
0 references
0.7299292087554932
0 references
0.7265912294387817
0 references
0.7257428169250488
0 references
