Nelder-Mead Simplex Optimization Routine for Large-Scale Problems: A Distributed Memory Implementation
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
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 43 (2014)
Issue (Month): 4 (April)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/10614/PS2|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mark Huggett, 2003.
"Human Capital and Earnings Distribution Dynamics,"
gueconwpa~03-03-10, Georgetown University, Department of Economics.
- Aldrich, Eric M. & Fernández-Villaverde, Jesús & Ronald Gallant, A. & Rubio-Ramírez, Juan F., 2011.
"Tapping the supercomputer under your desk: Solving dynamic equilibrium models with graphics processors,"
Journal of Economic Dynamics and Control,
Elsevier, vol. 35(3), pages 386-393, March.
- Eric M. Aldrich & Jesus Fernandez-Villaverde & A. Ronald Gallant & Juan F. Rubio-Ramirez, 2010. "Tapping the Supercomputer Under Your Desk: Solving Dynamic Equilibrium Models with Graphics Processors," Working Papers 10-89, Duke University, Department of Economics.
- Eric M. Aldrich & Jesús Fernández-Villaverde & Ronald Gallant & Juan F. Rubio-Ramírez, 2010. "Tapping the Supercomputer Under Your Desk: Solving Dynamic Equilibrium Models with Graphics Processors," PIER Working Paper Archive 10-014, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- Eric M. Aldrich & Jesús Fernández-Villaverde & A. Ronald Gallant & Juan F. Rubio-Ramírez, 2010. "Tapping the Supercomputer Under Your Desk: Solving Dynamic Equilibrium Models with Graphics Processors," NBER Working Papers 15909, National Bureau of Economic Research, Inc.
- Donghoon Lee & Matthew Wiswall, 2007. "A Parallel Implementation of the Simplex Function Minimization Routine," Computational Economics, Springer;Society for Computational Economics, vol. 30(2), pages 171-187, September.
- Michael Creel, 2005. "User-Friendly Parallel Computations with Econometric Examples," Computational Economics, Springer;Society for Computational Economics, vol. 26(2), pages 107-128, October.
- Christopher Ferrall, 2005. "Solving Finite Mixture Models: Efficient Computation in Economics Under Serial and Parallel Execution," Computational Economics, Springer;Society for Computational Economics, vol. 25(4), pages 343-379, June.
- Swann, Christopher A, 2002. "Maximum Likelihood Estimation Using Parallel Computing: An Introduction to MPI," Computational Economics, Springer;Society for Computational Economics, vol. 19(2), pages 145-178, April.
- Beaumont, Paul M & Bradshaw, Patrick T, 1995. "A Distributed Parallel Genetic Algorithm for Solving Optimal Growth Models," Computational Economics, Springer;Society for Computational Economics, vol. 8(3), pages 159-179, August.
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:43:y:2014:i:4:p:447-461. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.