On the convergence of one-dimensional simplex search
type: Item
instance of: scholarly article
title: On the convergence of one-dimensional simplex search
zbMATH Open document ID: 0662.90051
DOI: 10.1016/0305-0548(89)90013-0
published in: Computers \& Operations Research
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4083361
zbMATH Keywords: counterexample
zbMATH Keywords: convergence theorem
zbMATH Keywords: one-dimensional simplex search
author: Guoliang Xue
MaRDI profile type: Publication
full work available at URL: 0305-0548(89)90013-0
OpenAlex ID: W1985604951
cites work: One-dimensional simplex search
description: scientific article; zbMATH DE number 4083361