On the convergence of one-dimensional simplex search (Q1114590): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Guoliang Xue / rank | |||
| Property / author | |||
| Property / author: Guoliang Xue / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(89)90013-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985604951 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: One-dimensional simplex search / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:39, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence of one-dimensional simplex search |
scientific article |
Statements
On the convergence of one-dimensional simplex search (English)
0 references
1989
0 references
The simplex method proposed by \textit{J. A. Nelder} and \textit{R. Mead} [Computeer J. 7, 308-313 (1965; Zbl 0229.65053)] is a very efficient direct method for minimization. Recently, \textit{E. Choo} and \textit{C. Kim} [Comput. Oper. Res. 14, 47-54 (1987; Zbl 0625.90078)] proposed a one- dimensional simplex search, together with a convergence theorem. However, their convergence theorem is incorrect. The purpose of this paper is to prove a convergence theorem for their algorithm.
0 references
counterexample
0 references
convergence theorem
0 references
one-dimensional simplex search
0 references
