2004
DOI: 10.1016/j.compstruc.2004.03.072
|View full text |Cite
|
Sign up to set email alerts
|

Globalized Nelder–Mead method for engineering optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 192 publications
(43 citation statements)
references
References 4 publications
0
43
0
Order By: Relevance
“…To achieve this, numerical optimization techniques can be used to obtain a set of coefficients α s by minimization of difference between f n−m and k B T θ n−m . In practice, the globalized bounded Nelder-Mead algorithm 43 is used for the optimization. We note, however, that many other optimization methods can be also used to obtain α s by defining the test function f n = k B T  N s=0 α s α n+s and the target function k B T θ n .…”
Section: Appendix B: Colored Noise Generatormentioning
confidence: 99%
“…To achieve this, numerical optimization techniques can be used to obtain a set of coefficients α s by minimization of difference between f n−m and k B T θ n−m . In practice, the globalized bounded Nelder-Mead algorithm 43 is used for the optimization. We note, however, that many other optimization methods can be also used to obtain α s by defining the test function f n = k B T  N s=0 α s α n+s and the target function k B T θ n .…”
Section: Appendix B: Colored Noise Generatormentioning
confidence: 99%
“…With the results from the previous step, the system to optimize is then given by N nonlinear equations with NZ unknowns of the form shown in Eq. (13). Thus, As mentioned before, there are no restrictions in this equation.…”
Section: B Solve the Nonlinear Problem Using An Optimization Proceduresmentioning
confidence: 76%
“…To this end, a modification of the Nelder and Mead simplex method [11][12][13] was implemented. Such modifications define the stopping criteria and the subspace in which the solution is being optimized.…”
Section: B Solve the Nonlinear Problem Using An Optimization Proceduresmentioning
confidence: 99%
“…The mathematical equations for all these steps are given below Reflection:xr=x¯+δ1(xhx¯), Expansion:xe=x¯+δ2(xrx¯),  Contraction:xc=x¯+δ3(xhx¯),  Shrinkage:xe=x¯+δ4(xlxi);  i=0,1,,n, where δ 1 , δ 2 , δ 3 , and δ 4 are coefficients of reflection, expansion, contraction, and shrinkage, respectively. The typical values of these coefficients have been chosen as 1, 2, 0.5, and 0.5, respectively (Lagarias et al, 1998; Luersen and Riche, 2004). The schematic of the algorithm is shown in Figure 2.…”
Section: Methodsmentioning
confidence: 99%
“…The formulated pre-optimized model is passed to an iterative simplex method with initial parameter vector. The simplex algorithm (Spendley et al, 1962) and its modified version (Nelder and Mead, 1965) has frequently been used in past for many signal processing and engineering-design optimization applications (Luersen and Riche, 2004). Fifteen simulated data sets have been generated with known parameters to verify the correctness of the proposed algorithm.…”
Section: Introductionmentioning
confidence: 99%