Nelder-Mead Simplex Optimization Routine for Large-Scale Problems: A Distributed Memory Implementation

Kyle Klein and Julian Neira

Computational Economics, 2014, vol. 43, issue 4, 447-461

Abstract: The Nelder-Mead simplex method is an optimization routine that works well with irregular objective functions. For a function of $$n$$ parameters, it compares the objective function at the $$n+1$$ vertices of a simplex and updates the worst vertex through simplex search steps. However, a standard serial implementation can be prohibitively expensive for optimizations over a large number of parameters. We describe an implementation of the Nelder-Mead method in parallel using a distributed memory. For $$p$$ processors, each processor is assigned $$(n+1)/p$$ vertices at each iteration. Each processor then updates its worst local vertices, communicates the results, and a new simplex is formed with the vertices from all processors. We also describe how the algorithm can be implemented with only two MPI commands. In simulations, our implementation exhibits large speedups and is scalable to large problem sizes. Copyright Springer Science+Business Media New York 2014

Keywords: Parallel computing; Optimization algorithms; Nelder-Mead; C63 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10614-013-9377-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:compec:v:43:y:2014:i:4:p:447-461

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/10614/PS2

DOI: 10.1007/s10614-013-9377-8

Access Statistics for this article

Computational Economics is currently edited by Hans Amman

More articles in Computational Economics from Springer, Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().