A computational geometric approach to feasible region division in constrained global optimization

2002 9 citations

Abstract

Proposes the use of the Delaunay triangulation for feasible region division in constrained global optimization. The mathematical foundations for its use, along with the practical considerations for its implementation, are presented. The Delaunay triangulation algorithm is implemented in C.D. Perttunen's nonparametric method (1989). Results of this application are shown through the use of a standard set of test functions. The use of Delaunay triangulation is shown to yield a search in which the scatter plot of search points mimics the contour plot of the objective function under consideration.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Delaunay triangulationTriangulationConstrained Delaunay triangulationPlot (graphics)Mathematical optimizationSet (abstract data type)Division (mathematics)Computer scienceAlgorithmFunction (biology)MathematicsBowyer–Watson algorithmTheoretical computer scienceGeometryStatistics

Affiliated Institutions

Related Publications

Publication Info

Year
2002
Type
article
Pages
585-590
Citations
9
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

9
OpenAlex

Cite This

C.D. Perttunen (2002). A computational geometric approach to feasible region division in constrained global optimization. , 585-590. https://doi.org/10.1109/icsmc.1991.169748

Identifiers

DOI
10.1109/icsmc.1991.169748