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

MoreLess

Year of publication:	2014
Authors:	Easterling, David ; Watson, Layne ; Madigan, Michael ; Castle, Brent ; Trosset, Michael
Published in:	Computational Optimization and Applications. - Springer. - Vol. 57.2014, 2, p. 469-492
Publisher:	Springer
Subject:	Stochastic optimization \| Deterministic optimization \| Biomechanics \| Quadratic optimization \| Simulated annealing \| DIRECT \| QNSTOP \| KNITRO

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010896556