Authors: Gonçalves-E-Silva, Kayo
Aloise, Daniel
Xavier-De-Souza, Samuel
Mladenović, Nenad 
Title: Less is more: Simplified nelder-mead method for large unconstrained optimization
Journal: Yugoslav Journal of Operations Research
Volume: 28
Issue: 2
First page: 153
Last page: 169
Issue Date: 5-Jun-2018
Rank: M51
ISSN: 0354-0243
DOI: 10.2298/YJOR180120014G
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.
Keywords: Continuous optimization | Direct search methods | Less is more approach | Nelder mead method
Publisher: Faculty of Organizational Sciences, University of Belgrade
Project: CNPq-Brazil grants 308887/2014-0 and 400350/2014-9
RSF grant 14-41-00039

Show full item record


checked on Jun 13, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.