Global optimization with the direct algorithm

D. Finkel, C. T. Kelley

NCSU Libraries Repository (North Carolina State University Libraries) · 2005 · 71 citations · 31 references

Full text

Open access

Concepts

Abstract

This work describes theoretical results, and practical improvements to the DIRECT Algorithm, a direct search global optimization algorithm for bound-constrained problems. We rigorously show that a sub-sequence of the points sampled by the algorithm satisfy first order necessary conditions for both smooth and non-smooth problems. We show linear convergence of the algorithm for linear problems, and demonstrate why our analysis cannot be extended to more general problems.\n\nWe analyze a parameter of DIRECT, and show that it negatively affects the performance of the algorithm. A modified version of the DIRECT is introduced. Test examples are used to demonstrate the effectiveness of the modified algorithm.\n\nWe apply DIRECT to six well-field optimization problems from the literature. We collect data on the problems with DIRECT, and utilize statistical methods to glean information from the data about the well-field problems.

References

31