The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
On the Convergence of the Multidirectional Search Algorithm
Abstract
This paper presents the convergence analysis for the multidirectional search algorithm, a direct search method for unconstrained minimization. The analysis follows the classic lines of proofs of convergence for gradient-related methods. The novelty of the argument lies in the fact that explicit calculation of the gradient is unnecessary, although it is assumed that the function is continuously differentiable over some subset of the domain. The proof can be extended to treat most nonsmooth cases of interest; the argument breaks down only at points where the derivative exists but is not continuous. Finally, it is shown how a general convergence theory can be developed for an entire class of direct search methods—which includes such methods as the factorial design algorithm and the pattern search algorithm—that share a key feature of the multidirectional search algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
Spendley, W., Hext, G. R., & Himsworth, F. R. (1962) · Technometrics · doi:10.1080/00401706.1962.10490033 · Cited by 1,379
Evolutionary Operation: A Method for Increasing Industrial Productivity
Box, G. E. P. (1957) · Applied Statistics · doi:10.2307/2985505 · Cited by 576
Direct Search Methods on Parallel Machines
Dennis, J. E., & Torczon, V. (1992) · Operations Research ’91 · doi:10.1007/978-3-642-48417-9_2 · Cited by 279
Self-citationOptimization on Microcomputers: The Nelder-Mead Simplex Algorithm
Dennis, J. E., E., W. J., & Daniel, J. (1985) · doi:10.21236/ada453814 · Cited by 97
Cited by
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Self-citationRecent approaches to global optimization problems through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Natural Computing · doi:10.1023/a:1016568309421 · Cited by 1,406
On the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
Self-citationDerivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Direct search methods: then and now
Lewis, R. M., Torczon, V., & Trosset, M. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00423-4 · Cited by 648
Self-citation
Metadata
- Authors
- Torczon, V.
- Venue
- SIAM Journal on Optimization
- Published
- 1991-02
- Volume
- 1
- Issue
- 1
- Pages
- 123-145
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2064558818
- Cited by
- 260
- References
- 9
- FWCI
- 4.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Convergence of the Multidirectional Search Algorithm. https://app.cochat.ai/papers/10.1137/0801010
- The paper
- Torczon, V. (1991). On the Convergence of the Multidirectional Search Algorithm. SIAM Journal on Optimization. https://doi.org/10.1137/0801010
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.