One-dimensional simplex search (Q580188)
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 4016616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-dimensional simplex search |
scientific article; zbMATH DE number 4016616 |
Statements
One-dimensional simplex search (English)
0 references
1987
0 references
The nonlinear simplex method for unconstrained optimization by \textit{J. A. Nelder} and \textit{R. Mead} [Computer J. 7, 308-313 (1965; Zbl 0229.65053)] is modified for the one-dimensional case to yield a two-phase method whose convergence to the optimal solution is proved for unimodal functions. It is shown that by assigning proper values to the initial parameters, the method can be made to behave as the golden section search or the binary search.
0 references
nonlinear simplex method
0 references
unconstrained optimization
0 references
two-phase method
0 references
unimodal functions
0 references
golden section search
0 references
binary search
0 references
0.8850218057632446
0 references
0.8673390746116638
0 references
0.8443061113357544
0 references
0.8308930397033691
0 references
