SCGOSR: Surrogate-based constrained global optimization using space reduction

•A multi-start constrained optimization algorithm is presented to select promising solutions.•A novel space reduction strategy is presented based on two different penalty functions.•SCGOSR makes a reasonable tradeoff between “exploitation” and “exploration” in the proposed optimization framework.•SC...

Full description

Saved in:
Bibliographic Details
Published in:Applied soft computing Vol. 65; pp. 462 - 477
Main Authors: Dong, Huachao, Song, Baowei, Dong, Zuomin, Wang, Peng
Format: Journal Article
Language:English
Published: Elsevier B.V 01.04.2018
Subjects:
Constrained optimization
Expensive black-box problems
Kriging model
Penalty function
Space reduction
Penalty function
Kriging model
Space reduction
Expensive black-box problems
Constrained optimization
ISSN:1568-4946, 1872-9681
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•A multi-start constrained optimization algorithm is presented to select promising solutions.•A novel space reduction strategy is presented based on two different penalty functions.•SCGOSR makes a reasonable tradeoff between “exploitation” and “exploration” in the proposed optimization framework.•SCGOSR shows the wide applicability, high efficiency and strong stability on benchmark cases. Global optimization problems with computationally expensive objective and constraints are challenging. In this work, we present a new kriging-based constrained global optimization algorithm SCGOSR that can find global optima with fewer objective and constraint function evaluations. In SCGOSR, we propose a multi-start constrained optimization algorithm that can capture approximately local optimal points from kriging and select the promising ones for updating. In addition, according to two different penalty functions, two subspaces are created to construct local surrogate models and speed up the local search. Subspace1 is the neighborhood of the presented best solution, and Subspace2 is a region that covers several promising samples. The proposed multi-start constrained optimization is carried out alternately in Subspace1, Subspace2 and the global space. With iterations going on, kriging models of the costly objective and constraints are dynamically updated. In order to guarantee the balance between local and global search, the estimated mean square error of kriging is used to explore the unknown design space. Once SCGOSR gets stuck in a local valley, the algorithm will focus on the sparsely sampled regions. After comparison with 6 surrogate-based optimization algorithms on 13 representative cases, SCGOSR shows noticeable advantages in handling computationally expensive black-box problems.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2018.01.041