An empirical study of various candidate selection and partitioning techniques in the DIRECT framework
- 7 June 2022
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 88 (3) , 723-753
Abstract
No abstract availableKeywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Algorithm 897ACM Transactions on Mathematical Software, 2009
- GLOBAL OPTIMIZATION USING THE BRANCH‐AND‐BOUND ALGORITHM WITH A COMBINATION OF LIPSCHITZ BOUNDS OVER SIMPLICESTechnological and Economic Development of Economy, 2009
- Performance Modeling and Analysis of a Massively Parallel Direct—Part 2The International Journal of High Performance Computing Applications, 2009
- Performance Modeling and Analysis of a Massively Parallel Direct—Part 1The International Journal of High Performance Computing Applications, 2009
- IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEXMathematical Modelling and Analysis, 2008
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problemsComputational Optimization and Applications, 2008
- Algorithm 829ACM Transactions on Mathematical Software, 2003
- A fully-distributed parallel global search algorithmEngineering Computations, 2001
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Optimization by Simulated AnnealingScience, 1983