The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
A particle swarm pattern search method for bound constrained global optimization
Abstract
In this paper we develop, analyze, and test a new algorithm for the global minimization of a function subject to simple bounds without the use of derivatives. The underlying algorithm is a pattern search method, more specifically a coordinate search method, which guarantees convergence to stationary points from arbitrary starting points. In the optional search phase of pattern search we apply a particle swarm scheme to globally explore the possible nonconvexity of the objective function. Our extensive numerical experiments showed that the resulting algorithm is highly competitive with other global optimization methods also based on function values.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Lipschitzian optimization without the Lipschitz constant
Jones, D. R., Perttunen, C. D., & Stuckman, B. E. (1993) · Journal of Optimization Theory and Applications · doi:10.1007/bf00941892 · Cited by 1,976
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
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
An analysis of particle swarm optimizers
van den Bergh, F., & Engelbrecht, A. P. (2002) · UpSpace Institutional Repository (University of Pretoria) · Cited by 1,411
A study of particle swarm optimization particle trajectories
VANDENBERGH, F., & ENGELBRECHT, A. (2006) · Information Sciences · doi:10.1016/j.ins.2005.02.003 · Cited by 1,397
Random number generators: good ones are hard to find
Park, S. K., & Miller, K. W. (1988) · Communications of the ACM · doi:10.1145/63039.63042 · Cited by 1,262
Mesh Adaptive Direct Search Algorithms for Constrained Optimization
Audet, C., & Dennis, J. E. (2006) · SIAM Journal on Optimization · doi:10.1137/040603371 · Cited by 1,243
Cited by
Derivative-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
A NEW ELECTRON-DENSITY MODEL FOR ESTIMATION OF PULSAR AND FRB DISTANCES
Yao, J. M., Manchester, R. N., & Wang, N. (2017) · The Astrophysical Journal · doi:10.3847/1538-4357/835/1/29 · Cited by 1,114
Direct Multisearch for Multiobjective Optimization
Custódio, A. L., Madeira, J. F. A., Vaz, A. I. F., & Vicente, L. N. (2011) · SIAM Journal on Optimization · doi:10.1137/10079731x · Cited by 392
Self-citation
Metadata
- Authors
- Vaz, A. I. F., & Vicente, L. N.
- Venue
- Journal of Global Optimization
- Published
- 2007-02-06
- Volume
- 39
- Issue
- 2
- Pages
- 197-219
- ISSN
- 0925-5001 (ISSN-L)
- 1573-2916
- OpenAlex
- W2022451981
- Cited by
- 316
- References
- 28
- FWCI
- 16.94
- 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 particle swarm pattern search method for bound constrained global optimization. https://app.cochat.ai/papers/10.1007/s10898-007-9133-5
- The paper
- Vaz, A. I. F., & Vicente, L. N. (2007). A particle swarm pattern search method for bound constrained global optimization. Journal of Global Optimization. https://doi.org/10.1007/s10898-007-9133-5
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.