Collinear scaling and sequential estimation in sparse optimization algorithms

1982 ◽  
pp. 135-159 ◽  
Author(s):  
Danny C. Sorensen
Keyword(s):  
Optimization Algorithms ◽  
Sequential Estimation ◽  
Sparse Optimization

Sparse optimization algorithms

2013 ◽  
pp. 69-117 ◽  
Author(s):  
Zhu Han ◽  
Husheng Li ◽  
Wotao Yin
Keyword(s):  
Optimization Algorithms ◽  
Sparse Optimization

Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

Comparison of optimization algorithms for aerodynamic shape design

AIAA Journal ◽  
1997 ◽  
Vol 35 ◽  
pp. 1413-1415
Author(s):  
Shigeru Obayashi ◽  
Takanori Tsukahara
Keyword(s):  
Optimization Algorithms ◽  
Shape Design ◽  
Aerodynamic Shape
Sign in / Sign up

Export Citation Format

Share Document