Parallel deterministic and stochastic global minimization of functions with very many minima
The optimization of three problems with high dimensionality and many local minima are investigated under five different optimization algorithms: DIRECT, simulated annealing, Spall’s SPSA algorithm, the KNITRO package, and QNSTOP, a new algorithm developed at Indiana University. Copyright Springer Science+Business Media New York 2014
Volume (Year): 57 (2014)
Issue (Month): 2 (March)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/math/journal/10589|
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.:
- L. Ingber, 1993. "Simulated annealing: Practice versus theory," Lester Ingber Papers 93sa, Lester Ingber.
- Goffe, William L. & Ferrier, Gary D. & Rogers, John, 1994. "Global optimization of statistical functions with simulated annealing," Journal of Econometrics, Elsevier, vol. 60(1-2), pages 65-99.
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:57:y:2014:i:2:p:469-492. 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 references are entirely missing, you can add them using this form.