DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems
The fast-growing need for grey-box and black-box optimization methods for constrained global optimization problems in fields such as medicine, chemistry, engineering and artificial intelligence, has led to the development of new efficient algorithms for finding the best possible solution. In this wo...
Saved in:
Published in | Computational & applied mathematics Vol. 40; no. 5 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Cham
Springer International Publishing
01.07.2021
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The fast-growing need for grey-box and black-box optimization methods for constrained global optimization problems in fields such as medicine, chemistry, engineering and artificial intelligence, has led to the development of new efficient algorithms for finding the best possible solution. In this work, we present DEFT-FUNNEL, an open-source global optimization algorithm for general constrained grey-box and black-box problems that belongs to the class of trust-region sequential quadratic optimization algorithms. Polynomial interpolation models are used as surrogates for the black-box functions and a clustering-based multistart strategy is applied for searching for the global minima. Numerical experiments show that DEFT-FUNNEL compares favorably with state-of-the-art methods on two sets of benchmark problems: one set containing problems where every function is a black box and another set with problems where some of the functions and their derivatives are known to the solver. The code as well as the test sets used for experiments are available at the Github repository
http://github.com/phrsampaio/deft-funnel
. |
---|---|
ISSN: | 2238-3603 1807-0302 |
DOI: | 10.1007/s40314-021-01562-y |