The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Adaptive step size random search
Abstract
Fixed step size random search for minimization of functions of several parameters is described and compared with the fixed step size gradient method for a particular surface. A theoretical technique, using the optimum step size at each step, is analyzed. A practical adaptive step size random search algorithm is then proposed, and experimental experience is reported that shows the superiority of random search over other methods for sufficiently high dimension.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Buehler, R. J., & Wilde, D. J. (1965) · Econometrica · doi:10.2307/1909808 · Cited by 695
A Discussion of Random Methods for Seeking Maxima
Brooks, S. H. (1958) · Operations Research · doi:10.1287/opre.6.2.244 · Cited by 318
An Iterative Method for Finding Stationary Values of a Function of Several Variables
Powell, M. J. D. (1962) · The Computer Journal · doi:10.1093/comjnl/5.2.147 · Cited by 193
Cited by
Minimization by Random Search Techniques
Solis, F. J., & Wets, R. J.-B. (1981) · Mathematics of Operations Research · doi:10.1287/moor.6.1.19 · Cited by 1,671
A literature survey of benchmark functions for global optimisation problems
Jamil, M., & Yang, X. S. (2013) · International Journal of Mathematical Modelling and Numerical Optimisation · doi:10.1504/ijmmno.2013.055204 · Cited by 1,301
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
Differential Evolution: A review of more than two decades of research
Bilal, Pant, M., Zaheer, H., Garcia-Hernandez, L., & Abraham, A. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103479 · Cited by 1,002
Square Attack: A Query-Efficient Black-Box Adversarial Attack via Random Search
Andriushchenko, M., Croce, F., Flammarion, N., & Hein, M. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58592-1_29 · Cited by 800
Metadata
- Authors
- Schumer, M., & Steiglitz, K.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1968-06
- Volume
- 13
- Issue
- 3
- Pages
- 270-276
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2024372894
- Cited by
- 284
- References
- 5
- FWCI
- 5.65
- 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
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.