Journal article · 2018 · Open access
Less is more: Simplified Nelder-Mead method for large unconstrained optimization
Yugoslav journal of operations research, 28(2), 153–169 · Published 1 January 2018 · DOI 10.2298/yjor180120014g
In brief
“Less is more: Simplified Nelder-Mead method for large unconstrained optimization” is a 2018 journal article by Kayo Gonçalves e Silva and 3 co-authors, published in Yugoslav journal of operations research. OpenAlex counts 24 citations as of 16 November 2026. It is open access under a CC BY-NC-SA licence: the full text is free to read at Yugoslav journal of operations research.
- Citations
- 24
- Most cited in
- 2023 (6)
- Field-weighted impact
- 1.76
- References
- 20
- Authors
- 4
Abstract
Nelder-Mead method (NM) for solving continuous non-linear optimization problem is probably the most cited and the most used method in the optimization literature and in practical applications, too. It belongs to the direct search methods, those which do not use the first and the second order derivatives. The popularity of NM is based on its simplicity. In this paper we propose even more simple algorithm for larger instances that follows NM idea. We call it Simplified NM (SNM): instead of generating all n + 1 simplex points in Rn, we perform search using just q + 1 vertices, where q is usually much smaller than n. Though the results cannot be better than after performing calculations in n+1 points as in NM, significant speed-up allows to run many times SNM from different starting solutions, usually getting better results than those obtained by NM within the same cpu time. Computational analysis is performed on 10 classical convex and non-convex instances, where the number of variables n can be arbitrarily large. The obtained results show that SNM is more effective than the original NM, confirming that LIMA yields good results when solving a continuous optimization problem.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Silva, K. G. E., Aloise, D., Xavier‐de‐Souza, S., & Mladenović, N. (2018). Less is more: Simplified Nelder-Mead method for large unconstrained optimization. Yugoslav journal of operations research, 28(2), 153–169. https://doi.org/10.2298/yjor180120014g
MLA 9
Silva, Kayo Gonçalves e, et al. “Less is more: Simplified Nelder-Mead method for large unconstrained optimization.” Yugoslav journal of operations research, vol. 28, no. 2, 2018, pp. 153–169. https://doi.org/10.2298/yjor180120014g.
Chicago
Silva, Kayo Gonçalves e, Daniel Aloise, Samuel Xavier‐de‐Souza, and Nenad Mladenović. 2018. “Less is more: Simplified Nelder-Mead method for large unconstrained optimization.” Yugoslav journal of operations research 28 (2): 153–169. https://doi.org/10.2298/yjor180120014g.
Harvard
Silva, K. G. E. et al. (2018) ‘Less is more: Simplified Nelder-Mead method for large unconstrained optimization’, Yugoslav journal of operations research, 28(2), pp. 153–169. doi:10.2298/yjor180120014g.
IEEE
K. G. E. Silva, D. Aloise, S. Xavier‐de‐Souza, and N. Mladenović, “Less is more: Simplified Nelder-Mead method for large unconstrained optimization,” Yugoslav journal of operations research, vol. 28, no. 2, pp. 153–169, 2018, doi: 10.2298/yjor180120014g.
BibTeX
@article{silva2018less,
title = {{Less is more: Simplified Nelder-Mead method for large unconstrained optimization}},
author = {Silva, Kayo Gonçalves e and Aloise, Daniel and Xavier‐de‐Souza, Samuel and Mladenović, Nenad},
journal = {Yugoslav journal of operations research},
year = {2018},
volume = {28},
number = {2},
pages = {153--169},
doi = {10.2298/yjor180120014g},
url = {https://doi.org/10.2298/yjor180120014g}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 1 | |
| 2019 | 2 | |
| 2020 | 2 | |
| 2021 | 3 | |
| 2022 | 4 | |
| 2023 | 6 | |
| 2024 | 2 | |
| 2025 | 2 | |
| 2026 | 2 |
Its field-weighted citation impact is 1.76: it has been cited 1.76 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 methods
- unconstrained optimization
- large-scale optimization
- simplex search
- non-convex optimization
- convex optimization
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Silva, K. G. E., Aloise, D., Xavier‐de‐Souza, S., & Mladenović, N. (2018). Less is more: Simplified Nelder-Mead method for large unconstrained optimization. Yugoslav journal of operations research, 28(2), 153–169. https://doi.org/10.2298/yjor180120014g
How many times has this paper been cited?
24 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?
Yes. It is open access: read the free full text at Yugoslav journal of operations research.
Who wrote this paper?
Kayo Gonçalves e Silva, Daniel Aloise, Samuel Xavier‐de‐Souza, Nenad Mladenović.
What is the DOI of this paper?
10.2298/yjor180120014g. The permanent link is https://doi.org/10.2298/yjor180120014g.
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.