Encyclopedia of Aerospace Engineering 2010
DOI: 10.1002/9780470686652.eae495
|View full text |Cite
|
Sign up to set email alerts
|

Review of Optimization Techniques

Abstract: A basic overview of optimization techniques is provided. The standard form of the general non-linear, constrained optimization problem is presented, and various techniques for solving the resulting optimization problem are discussed. The techniques are classified as either local (typically gradient-based) or global (typically nongradient based or evolutionary) algorithms. A great many optimization techniques exist and it is not possible to provide a complete review in the limited space available here. Instead,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
89
0
1

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 161 publications
(90 citation statements)
references
References 25 publications
0
89
0
1
Order By: Relevance
“…The choice of optimization technique will ultimately depend on these factors. Optimization algorithms can be divided into two basic groups: local or global [14].…”
Section: Optimization Methodsmentioning
confidence: 99%
“…The choice of optimization technique will ultimately depend on these factors. Optimization algorithms can be divided into two basic groups: local or global [14].…”
Section: Optimization Methodsmentioning
confidence: 99%
“…We advise reading this excellent book for a deep review study (Talbi 2009). The techniques can be classified as either local (typically gradient-based) or global (typically non-gradient based or evolutionary) algorithms (Venter 2010). Among the existing techniques there are: gradient descent (GD) (Bottou 2012), Ant colony (Hajjem et al 2017), genetic algorithms (GA) (Goldberg 1989;Oliver 2017), evolutionary hill climbing (Abramson et al 2006), particle swarm optimization (PSO) (Poli et al 2007), taboo search (Glover and Laguna 1997).…”
Section: Description Of the Meta-heuristics Boosted Weak Learnersmentioning
confidence: 99%
“…Genetic algorithms are thereby especially useful for a relatively wide-ranged search in the design space. In general, evolutionary algorithms perform much better in finding the global or near global optimum in the presence of multiple local extrema than gradient-based methods and are well suited for discrete optimization problems [175]. The main drawback is the high numerical effort since a large number of problem solutions are required.…”
Section: Evolutionary Optimization Algorithmsmentioning
confidence: 99%
“…The standard form for a single-objective, nonlinear, constrained optimization problem is provided as [175],…”
Section: Optimization Algorithmsmentioning
confidence: 99%