Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

GOSAC: global optimization with surrogate approximation of constraints

GOSAC: global optimization with surrogate approximation of constraints We introduce GOSAC, a global optimization algorithm for problems with computationally expensive black-box constraints and computationally cheap objective functions. The variables may be continuous, integer, or mixed-integer. GOSAC uses a two-phase optimization approach. The first phase aims at finding a feasible point by solving a multi-objective optimization problem in which the constraints are minimized simultaneously. The second phase aims at improving the feasible solution. In both phases, we use cubic radial basis function surrogate models to approximate the computationally expensive constraints. We iteratively select sample points by minimizing the computationally cheap objective function subject to the constraint function approximations. We assess GOSAC’s efficiency on computationally cheap test problems with integer, mixed-integer, and continuous variables and two environmental applications. We compare GOSAC to NOMAD and a genetic algorithm (GA). The results of the numerical experiments show that for a given budget of allowed expensive constraint evaluations, GOSAC finds better feasible solutions more efficiently than NOMAD and GA for most benchmark problems and both applications. GOSAC finds feasible solutions with a higher probability than NOMAD and GOSAC. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Global Optimization Springer Journals

GOSAC: global optimization with surrogate approximation of constraints

Loading next page...
1
 
/lp/springer_journal/gosac-global-optimization-with-surrogate-approximation-of-constraints-UsoNEK6C7i

References (44)

Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer Science+Business Media New York (outside the USA)
Subject
Mathematics; Optimization; Operations Research/Decision Theory; Real Functions; Computer Science, general
ISSN
0925-5001
eISSN
1573-2916
DOI
10.1007/s10898-017-0496-y
Publisher site
See Article on Publisher Site

Abstract

We introduce GOSAC, a global optimization algorithm for problems with computationally expensive black-box constraints and computationally cheap objective functions. The variables may be continuous, integer, or mixed-integer. GOSAC uses a two-phase optimization approach. The first phase aims at finding a feasible point by solving a multi-objective optimization problem in which the constraints are minimized simultaneously. The second phase aims at improving the feasible solution. In both phases, we use cubic radial basis function surrogate models to approximate the computationally expensive constraints. We iteratively select sample points by minimizing the computationally cheap objective function subject to the constraint function approximations. We assess GOSAC’s efficiency on computationally cheap test problems with integer, mixed-integer, and continuous variables and two environmental applications. We compare GOSAC to NOMAD and a genetic algorithm (GA). The results of the numerical experiments show that for a given budget of allowed expensive constraint evaluations, GOSAC finds better feasible solutions more efficiently than NOMAD and GA for most benchmark problems and both applications. GOSAC finds feasible solutions with a higher probability than NOMAD and GOSAC.

Journal

Journal of Global OptimizationSpringer Journals

Published: Jan 28, 2017

There are no references for this article.