This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Constrained optimization involving expensive function evaluations : a sequential approach

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Brekelmans, R.
Driessen, L.
Hamers, H.
Hertog, D. den (Tilburg University, Center for Economic Research)

Additional information is available for the following registered author(s):

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).

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://arno.uvt.nl/show.cgi?fid=4285
File Format: application/pdf
File Function:
Download Restriction: no
File URL: http://arno.uvt.nl/show.cgi?fid=4286
File Format: application/postscript
File Function:
Download Restriction: no

Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 87.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2001
Date of revision:
Handle: RePEc:dgr:kubcen:200187

Contact details of provider:
Web page: http://center.uvt.nl

For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).

Related research
Keywords:

Other versions of this item:

Find related papers by JEL classification:
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis

This paper has been announced in the following NEP Reports:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
  1. Driessen, L. & Brekelmans, R. & Hamers, H. & Hertog, D. den, 2001. "On D-optimality based trust regions for black-box optimization problems," Discussion Paper 69, Tilburg University, Center for Economic Research. [Downloadable!]
Full references

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)

  1. Driessen, Lonneke & Brekelmans, Ruud & Gerichhausen, Marloes & ...,, 2006. "Why methods for optimization problems with time-consuming function evaluations and integer variables should use global approximation models," Discussion Paper 4, Tilburg University, Center for Economic Research. [Downloadable!]
  2. Driessen, L. & Brekelmans, R. & Hamers, H. & Hertog, D. den, 2001. "On D-optimality based trust regions for black-box optimization problems," Discussion Paper 69, Tilburg University, Center for Economic Research. [Downloadable!]
Statistics
Access and download statistics

Did you know? About 1000 journals are listed on RePEc.

This page was last updated on 2009-11-25.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.