Parallel deterministic and stochastic global minimization of functions with very many minima
DOI10.1007/s10589-013-9592-1zbMath1304.90162OpenAlexW2015863994MaRDI QIDQ461454
David R. Easterling, Michael L. Madigan, Layne T. Watson, Brent S. Castle, Michael W. Trosset
Publication date: 10 October 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://eprints.cs.vt.edu/archive/00001167/
DIRECTstochastic optimizationsimulated annealingquadratic optimizationbiomechanicsdeterministic optimizationKNITROQNSTOP
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Stochastic programming (90C15)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimization of statistical functions with simulated annealing
- Optimization by Simulated Annealing
- Design and implementation of a massively parallel version of DIRECT
- Lipschitzian optimization without the Lipschitz constant
- Simulated annealing: Practice versus theory
- Dynamic data structures for a direct search algorithm
- Duality principles in nonconvex systems. Theory, methods and applications
- A fully‐distributed parallel global search algorithm
- Algorithm 897
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- The Wave Annihilation Technique and the Design of Nonreflective Coatings
- Trust Region Methods
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Global Random Optimization by Simultaneous Perturbation Stochastic Approximation
- Stochastic Estimation of the Maximum of a Regression Function
- A trust region method based on interior point techniques for nonlinear programming.
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
This page was built for publication: Parallel deterministic and stochastic global minimization of functions with very many minima