We consider a derivative-free optimization, and in particular black box optimization, where the functions to be minimized and the functions representing the constraints are given by black boxes without derivatives. Two fundamental families of methods are available: model-based methods and directional direct search algorithms. This work exploits the flexibility of the second type of methods in order to integrate to a limited extent the models used in the first family. Intensive numerical tests on two sets of 48 and 104 test problems illustrate the efficiency of this hybridization and show that the use of the models improves the performance of the mesh- adaptive direct search algorithm significantly.
%0 Journal Article
%1 doi:10.1080/10556788.2011.623162
%A Conn, Andrew R.
%A Digabel, Sébastien Le
%D 2013
%J Optimization Methods and Software
%K conn optimization pcg_optimization
%N 1
%P 139-158
%R 10.1080/10556788.2011.623162
%T Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
%U /brokenurl# http://dx.doi.org/10.1080/10556788.2011.623162
%V 28
%X We consider a derivative-free optimization, and in particular black box optimization, where the functions to be minimized and the functions representing the constraints are given by black boxes without derivatives. Two fundamental families of methods are available: model-based methods and directional direct search algorithms. This work exploits the flexibility of the second type of methods in order to integrate to a limited extent the models used in the first family. Intensive numerical tests on two sets of 48 and 104 test problems illustrate the efficiency of this hybridization and show that the use of the models improves the performance of the mesh- adaptive direct search algorithm significantly.
@article{doi:10.1080/10556788.2011.623162,
abstract = { We consider a derivative-free optimization, and in particular black box optimization, where the functions to be minimized and the functions representing the constraints are given by black boxes without derivatives. Two fundamental families of methods are available: model-based methods and directional direct search algorithms. This work exploits the flexibility of the second type of methods in order to integrate to a limited extent the models used in the first family. Intensive numerical tests on two sets of 48 and 104 test problems illustrate the efficiency of this hybridization and show that the use of the models improves the performance of the mesh- adaptive direct search algorithm significantly. },
added-at = {2016-03-15T15:23:43.000+0100},
author = {Conn, Andrew R. and Digabel, Sébastien Le},
biburl = {https://www.bibsonomy.org/bibtex/2ef5a2da96858e1cd39f9e845cb963460/einar90},
doi = {10.1080/10556788.2011.623162},
eprint = {http://dx.doi.org/10.1080/10556788.2011.623162},
interhash = {f127ba3e5a83887e5c47e63b36ed436f},
intrahash = {ef5a2da96858e1cd39f9e845cb963460},
journal = {Optimization Methods and Software},
keywords = {conn optimization pcg_optimization},
number = 1,
pages = {139-158},
timestamp = {2016-03-15T15:23:43.000+0100},
title = {Use of quadratic models with mesh-adaptive direct search for constrained black box optimization},
url = {/brokenurl# http://dx.doi.org/10.1080/10556788.2011.623162 },
volume = 28,
year = 2013
}