A cover partitioning method for bound constrained global optimization

A stochastic algorithm for global optimization subject to simple bounds is described. The method is applicable to black-box functions which may be non-smooth or discontinuous. The algorithm is in the spirit of the deterministic algorithm direct of Jones, Perttunen, and Stuckman. Like direct, it gene...

Full description

Saved in:
Bibliographic Details
Published in:Optimization methods & software 2012-12, Vol.27 (6), p.1059-1072
Main Authors: Price, C. J., Reale, M., Robertson, B. L.
Format: Article
Language:English
Subjects:
Algorithms
Computer programs
direct search
dividing rectangles
Mathematical analysis
Mathematical models
Optimization
Partitioning
Software
stochastic global optimization
Stochasticity
Studies
tilecutter
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A stochastic algorithm for global optimization subject to simple bounds is described. The method is applicable to black-box functions which may be non-smooth or discontinuous. The algorithm is in the spirit of the deterministic algorithm direct of Jones, Perttunen, and Stuckman. Like direct, it generates successively finer covers of the feasible region, where each cover consists of a finite number of boxes, and each box is defined by simple bounds. Its principal difference is that it calculates the objective at a randomly selected point in each unpopulated box, rather than at the centre of the box. A limited storage version of the algorithm is also presented. The sequence of best-known function values is shown to converge to the essential minimum with probability 1 for both versions of the algorithm. A worst case expected rate theorem is established. Numerical results are presented which show the methods are effective in practice.
ISSN:1055-6788
1029-4937
DOI:10.1080/10556788.2011.557726