1975
DOI: 10.1080/00401706.1975.10489269
|View full text |Cite
|
Sign up to set email alerts
|

The Nelder-Mead Simplex Procedure for Function Minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
118
0
4

Year Published

1997
1997
2017
2017

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 335 publications
(122 citation statements)
references
References 17 publications
0
118
0
4
Order By: Relevance
“…We found that the Nelder-Mead simplex method has been quite effective to solve this minimization problem [7]. It is straightforward to calculate i P and ( ) U n once each i λ is obtained.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…We found that the Nelder-Mead simplex method has been quite effective to solve this minimization problem [7]. It is straightforward to calculate i P and ( ) U n once each i λ is obtained.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…The calculation of the dipole topographies was based on the three-layer spherical volume conduction model of the head [2]. Either each point of the three-dimensional coordinate grid was scanned, or a procedure of non-gradient optimization (e.g., Nelder-Mead Simplex [19]) was used to find the coordinates of the dipole minimizing the residual error.…”
Section: Methodsmentioning
confidence: 99%
“…Similarly, Yan at al [1] use cosine similarity over the topic distributions and empirically set thresholds to detect links between communities. RCMB however brings this idea further by taking into account also the migrations of authors from one community to another and finding automatically the relevant thresholds by minimizing an evaluation function with the Nelder-Mead algorithm [18]. In addition, RCMB relies on the chi-square test and a sliding window algorithm to detect significant changes in the topic distribution of a community.…”
Section: State Of the Artmentioning
confidence: 99%
“…We determine those values by using the NelderMead algorithm [18], which is a derivative-free optimization method. The NelderMead algorithm is used to solve parameter estimation problems where the function values are uncertain or subject to noise.…”
Section: As In [1] the Cs(cd) Measure Is Used To Detect Two Differementioning
confidence: 99%