Direct search and stochastic optimization applied to two nonconvex nonsmooth problems

Authors:
David R. Easterling;Layne T. Watson;Michael L. Madigan;Brent S. Castle;Michael W. Trosset
Affiliations:
Indiana University, Bloomington, IN;Indiana University, Bloomington, IN;Indiana University, Bloomington, IN;Indiana University, Bloomington, IN;Indiana University, Bloomington, IN
Venue:
Proceedings of the 2012 Symposium on High Performance Computing
Year:
2012

Citing 7
Cited 0

Lipschitzian optimization without the Lipschitz constant

Journal of Optimization Theory and Applications
Canonical Dual Transformation Method and Generalized Triality Theory in Nonsmooth Global Optimization*

Journal of Global Optimization
Dynamic Data Structures for a Direct Search Algorithm

Computational Optimization and Applications
Design and implementation of a massively parallel version of DIRECT

Computational Optimization and Applications
Performance Modeling and Analysis of a Massively Parallel Direct - Part 1

International Journal of High Performance Computing Applications
Algorithm 897: VTDIRECT95: Serial and parallel codes for the global optimization algorithm direct

ACM Transactions on Mathematical Software (TOMS)
Results of two global optimization algorithms applied to a problem in biomechanics

SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The optimization of two problems with high dimensionality and many local minima are investigated under two different optimization algorithms: DIRECT and QNSTOP, a new algorithm developed at Indiana University.