The DOI matches its OpenAlex record; 4 of the 4 references it cites were found in a registry or an index.
A Note on the Extended Rosenbrock Function
Abstract
The Rosenbrock function is a well-known benchmark for numerical optimization problems, which is frequently used to assess the performance of Evolutionary Algorithms. The classical Rosenbrock function, which is a two-dimensional unimodal function, has been extended to higher dimensions in recent years. Many researchers take the high-dimensional Rosenbrock function as a unimodal function by instinct. In 2001 and 2002, Hansen and Deb found that the Rosenbrock function is not a unimodal function for higher dimensions although no theoretical analysis was provided. This paper shows that the n-dimensional (n = 4 approximately 30) Rosenbrock function has 2 minima, and analysis is proposed to verify this. The local minima in some cases are presented. In addition, this paper demonstrates that one of the "local minima" for the 20-variable Rosenbrock function found by Deb might not in fact be a local minimum.
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization
Deb, K., Anand, A., & Joshi, D. (2002) · Evolutionary Computation · doi:10.1162/106365602760972767 · Cited by 614
Microgenetic algorithms as generalized hill-climbing operators for GA optimization
Kazarlis, S., Papadakis, S. E., Theocharis, J. B., & Petridis, V. (2001) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.930311 · Cited by 149
Cited by
Cuckoo Search via Lévy flights
Yang, X.-S., & Deb, S. (2009) · 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393690 · Cited by 6,185
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Differential Evolution Using a Neighborhood-Based Mutation Operator
Das, S., Abraham, A., Chakraborty, U. K., & Konar, A. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009457 · Cited by 1,165
Orthogonal Learning Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2052054 · Cited by 725
A modified artificial bee colony algorithm
Gao, W.-F., & Liu, S.-Y. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2011.06.007 · Cited by 609
Metadata
- Authors
- Shang, Y.-W., & Qiu, Y.-H.
- Venue
- Evolutionary Computation
- Publisher
- The MIT Press
- Published
- 2006-02-26
- Volume
- 14
- Issue
- 1
- Pages
- 119-126
- ISSN
- 1063-6560 (ISSN-L)
- OpenAlex
- W4237344571
- Cited by
- 321
- References
- 4
- FWCI
- 14.93
- 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: A Note on the Extended Rosenbrock Function. https://app.cochat.ai/papers/10.1162/106365606776022733
- The paper
- Shang, Y.-W., & Qiu, Y.-H. (2006). A Note on the Extended Rosenbrock Function. Evolutionary Computation. https://doi.org/10.1162/106365606776022733
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.