Journal article · 1974

A Sequential Simplex Program for Solving Minimization Problems

Donald M. Olsson

Journal of Quality Technology, 6(1), 53–57 · Published 1 January 1974 · DOI 10.1080/00224065.1974.11980616

View at the publisherCite this paper

In brief

“A Sequential Simplex Program for Solving Minimization Problems” is a 1974 journal article by Donald M. Olsson, published in Journal of Quality Technology. OpenAlex counts 132 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
132
Most cited in
2012 (5)
Field-weighted impact
0.94
References
4
Authors
1

Abstract

Nelder and Mead [2] have developed a simple, robust direct-search procedure for finding the minimum of a function. It consists of evaluating a function of n variables at the (n + 1) vertices of a general simplex. The simplex is then moved away from the largest function value by replacing the vertex having this value… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Olsson, D. M. (1974). A Sequential Simplex Program for Solving Minimization Problems. Journal of Quality Technology, 6(1), 53–57. https://doi.org/10.1080/00224065.1974.11980616

MLA 9

Olsson, Donald M. “A Sequential Simplex Program for Solving Minimization Problems.” Journal of Quality Technology, vol. 6, no. 1, 1974, pp. 53–57. https://doi.org/10.1080/00224065.1974.11980616.

Chicago

Olsson, Donald M. 1974. “A Sequential Simplex Program for Solving Minimization Problems.” Journal of Quality Technology 6 (1): 53–57. https://doi.org/10.1080/00224065.1974.11980616.

Harvard

Olsson, D. M. (1974) ‘A Sequential Simplex Program for Solving Minimization Problems’, Journal of Quality Technology, 6(1), pp. 53–57. doi:10.1080/00224065.1974.11980616.

IEEE

D. M. Olsson, “A Sequential Simplex Program for Solving Minimization Problems,” Journal of Quality Technology, vol. 6, no. 1, pp. 53–57, 1974, doi: 10.1080/00224065.1974.11980616.

BibTeX

@article{olsson1974sequential,
  title     = {{A Sequential Simplex Program for Solving Minimization Problems}},
  author    = {Olsson, Donald M.},
  journal   = {Journal of Quality Technology},
  year      = {1974},
  volume    = {6},
  number    = {1},
  pages     = {53--57},
  doi       = {10.1080/00224065.1974.11980616},
  url       = {https://doi.org/10.1080/00224065.1974.11980616}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201255
201311
201411
201633
201722
201811
202122

Its field-weighted citation impact is 0.94: it has been cited 0.94 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • Nelder-Mead algorithm
  • direct search
  • function minimization
  • multivariate optimization
  • robust optimization

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Olsson, D. M. (1974). A Sequential Simplex Program for Solving Minimization Problems. Journal of Quality Technology, 6(1), 53–57. https://doi.org/10.1080/00224065.1974.11980616

How many times has this paper been cited?

132 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Donald M. Olsson.

What is the DOI of this paper?

10.1080/00224065.1974.11980616. The permanent link is https://doi.org/10.1080/00224065.1974.11980616.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.