An efficient algorithm for unconstrained optimization (Q1664864)
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 6925668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for unconstrained optimization |
scientific article; zbMATH DE number 6925668 |
Statements
An efficient algorithm for unconstrained optimization (English)
0 references
27 August 2018
0 references
Summary: This paper presents an original and efficient PSO algorithm, which is divided into three phases: (1) stabilization, (2) breadth-first search, and (3) depth-first search. The proposed algorithm, called PSO-3P, was tested with 47 benchmark continuous unconstrained optimization problems, on a total of 82 instances. The numerical results show that the proposed algorithm is able to reach the global optimum. This work mainly focuses on unconstrained optimization problems from 2 to 1,000 variables.
0 references
0 references
0 references
0.8304029703140259
0 references
0.795663058757782
0 references
0.7736711502075195
0 references
0.7731993794441223
0 references
0.772860050201416
0 references
