Constrained Optimization Involving Expensive Function Evaluations: A Sequential Approach

Research output: Working paperDiscussion paperOther research output

297 Downloads (Pure)

Abstract

This paper presents a new sequential method for constrained non-linear optimization problems.The principal characteristics of these problems are very time consuming function evaluations and the absence of derivative information. Such problems are common in design optimization, where time consuming function evaluations are carried out by simulation tools (e.g., FEM, CFD).Classical optimization methods, based on derivatives, are not applicable because often derivative information is not available and is too expensive to approximate through finite differencing.The algorithm first creates an experimental design. In the design points the underlying functions are evaluated.Local linear approximations of the real model are obtained with help of weighted regression techniques.The approximating model is then optimized within a trust region to find the best feasible objective improving point.This trust region moves along the most promising direction, which is determined on the basis of the evaluated objective values and constraint violations combined in a filter criterion.If the geometry of the points that determine the local approximations becomes bad, i.e. the points are located in such a way that they result in a bad approximation of the actual model, then we evaluate a geometry improving instead of an objective improving point.In each iteration a new local linear approximation is built, and either a new point is evaluated (objective or geometry improving) or the trust region is decreased.Convergence of the algorithm is guided by the size of this trust region.The focus of the approach is on getting good solutions with a limited number of function evaluations (not necessarily on reaching high accuracy).
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages25
Volume2001-87
Publication statusPublished - 2001

Publication series

NameCentER Discussion Paper
Volume2001-87

Fingerprint

Function evaluation
Constrained optimization
Derivatives
Geometry
Design of experiments
Computational fluid dynamics
Finite element method

Keywords

  • optimization
  • nonlinear programming

Cite this

@techreport{c94095bf906947e6b77e5e08c1382439,
title = "Constrained Optimization Involving Expensive Function Evaluations: A Sequential Approach",
abstract = "This paper presents a new sequential method for constrained non-linear optimization problems.The principal characteristics of these problems are very time consuming function evaluations and the absence of derivative information. Such problems are common in design optimization, where time consuming function evaluations are carried out by simulation tools (e.g., FEM, CFD).Classical optimization methods, based on derivatives, are not applicable because often derivative information is not available and is too expensive to approximate through finite differencing.The algorithm first creates an experimental design. In the design points the underlying functions are evaluated.Local linear approximations of the real model are obtained with help of weighted regression techniques.The approximating model is then optimized within a trust region to find the best feasible objective improving point.This trust region moves along the most promising direction, which is determined on the basis of the evaluated objective values and constraint violations combined in a filter criterion.If the geometry of the points that determine the local approximations becomes bad, i.e. the points are located in such a way that they result in a bad approximation of the actual model, then we evaluate a geometry improving instead of an objective improving point.In each iteration a new local linear approximation is built, and either a new point is evaluated (objective or geometry improving) or the trust region is decreased.Convergence of the algorithm is guided by the size of this trust region.The focus of the approach is on getting good solutions with a limited number of function evaluations (not necessarily on reaching high accuracy).",
keywords = "optimization, nonlinear programming",
author = "R.C.M. Brekelmans and L. Driessen and H.J.M. Hamers and {den Hertog}, D.",
note = "Pagination: 25",
year = "2001",
language = "English",
volume = "2001-87",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Brekelmans, RCM, Driessen, L, Hamers, HJM & den Hertog, D 2001 'Constrained Optimization Involving Expensive Function Evaluations: A Sequential Approach' CentER Discussion Paper, vol. 2001-87, Operations research, Tilburg.

Constrained Optimization Involving Expensive Function Evaluations : A Sequential Approach. / Brekelmans, R.C.M.; Driessen, L.; Hamers, H.J.M.; den Hertog, D.

Tilburg : Operations research, 2001. (CentER Discussion Paper; Vol. 2001-87).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Constrained Optimization Involving Expensive Function Evaluations

T2 - A Sequential Approach

AU - Brekelmans, R.C.M.

AU - Driessen, L.

AU - Hamers, H.J.M.

AU - den Hertog, D.

N1 - Pagination: 25

PY - 2001

Y1 - 2001

N2 - This paper presents a new sequential method for constrained non-linear optimization problems.The principal characteristics of these problems are very time consuming function evaluations and the absence of derivative information. Such problems are common in design optimization, where time consuming function evaluations are carried out by simulation tools (e.g., FEM, CFD).Classical optimization methods, based on derivatives, are not applicable because often derivative information is not available and is too expensive to approximate through finite differencing.The algorithm first creates an experimental design. In the design points the underlying functions are evaluated.Local linear approximations of the real model are obtained with help of weighted regression techniques.The approximating model is then optimized within a trust region to find the best feasible objective improving point.This trust region moves along the most promising direction, which is determined on the basis of the evaluated objective values and constraint violations combined in a filter criterion.If the geometry of the points that determine the local approximations becomes bad, i.e. the points are located in such a way that they result in a bad approximation of the actual model, then we evaluate a geometry improving instead of an objective improving point.In each iteration a new local linear approximation is built, and either a new point is evaluated (objective or geometry improving) or the trust region is decreased.Convergence of the algorithm is guided by the size of this trust region.The focus of the approach is on getting good solutions with a limited number of function evaluations (not necessarily on reaching high accuracy).

AB - This paper presents a new sequential method for constrained non-linear optimization problems.The principal characteristics of these problems are very time consuming function evaluations and the absence of derivative information. Such problems are common in design optimization, where time consuming function evaluations are carried out by simulation tools (e.g., FEM, CFD).Classical optimization methods, based on derivatives, are not applicable because often derivative information is not available and is too expensive to approximate through finite differencing.The algorithm first creates an experimental design. In the design points the underlying functions are evaluated.Local linear approximations of the real model are obtained with help of weighted regression techniques.The approximating model is then optimized within a trust region to find the best feasible objective improving point.This trust region moves along the most promising direction, which is determined on the basis of the evaluated objective values and constraint violations combined in a filter criterion.If the geometry of the points that determine the local approximations becomes bad, i.e. the points are located in such a way that they result in a bad approximation of the actual model, then we evaluate a geometry improving instead of an objective improving point.In each iteration a new local linear approximation is built, and either a new point is evaluated (objective or geometry improving) or the trust region is decreased.Convergence of the algorithm is guided by the size of this trust region.The focus of the approach is on getting good solutions with a limited number of function evaluations (not necessarily on reaching high accuracy).

KW - optimization

KW - nonlinear programming

M3 - Discussion paper

VL - 2001-87

T3 - CentER Discussion Paper

BT - Constrained Optimization Involving Expensive Function Evaluations

PB - Operations research

CY - Tilburg

ER -